Loading...
Scaling and universality in continuous length combinatorial optimization
We consider combinatorial optimization problems defined over random ensembles and study how solution cost increases when the optimal solution undergoes a small perturbation δ. For the minimum spanning tree, the increase in cost scales as δ(2). For the minimum matching and traveling salesman problems...
Na minha lista:
| Main Authors: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
National Academy of Sciences
2003
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC208736/ https://ncbi.nlm.nih.gov/pubmed/14504403 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1635191100 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|