טוען...
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...
שמור ב:
| Main Authors: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
National Academy of Sciences
2003
|
| נושאים: | |
| גישה מקוונת: | 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 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|