Capacitateci metrie labeling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 976-995

  Andrews, Matthew ^a   Hajiaghayi, Mohammad Taghi ^b   Karloff, Howard ^c   Moitra, Ankur ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c ATT Labs Research   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; COMPLEXITY ASSUMPTIONS; METRIC LABELING; PARAMETER RANGE; POLYNOMIAL-TIME; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; WEIGHTED GRAPH;

COST FUNCTIONS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 79955714043     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. K. Andreev and H. Räcke, Balanced graph partitioning, Theory of Computing Systems (2000), pp. 929-939.
2. M. Andrews, J. Chuzhoy, V. Guruswami, S. Khanna, K. Tal war, and L. Zhang, Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs, Electronic Colloquium on Computational Complexity (2007).
3. M. Andrews, J. Chuzhoy, S. Khanna, and L. Zhang, Hardness of the undirected edge-disjoint paths problem with congestion, Foundations of Computer Science (2005), pp. 226-244.
4. M. Andrews and L. Zhang, Wavelength assignment in optical networks with fixed fiber capacity, International Colloquium on Automata, Languages and Programming (2004), pp. 134-145.
5. M. Andrews and L. Zhang, Hardness of undirected edge-disjoint paths problem, Symposium on Theory of Computing (2005), pp. 276-283. (Pubitemid 43098597)
6. A. Archer, J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, K. Talwar, and E. Tardos, Approximate classification via earthmover metrics, Symposium on Discrete Algorithms (2004), pp. 1072-1080.
7. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Foundations of Computer Science (1996), pp. 184-193.
8. G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem, SIAM Journal on Computing, 34 (2004), pp. 358-372. (Pubitemid 40645166)
9. C. Chekuri, S. Khanna, J. Naor, and L. Zosin. Approximation algorithms for the metric labeling problem via a new linear programming formulation, Symposium on Discrete Algorithms (2001), pp. 109-118.
10. J. Chuzhoy, V. Guruswami, S. Khanna, and K. Talwar, Hardness of routing with congestion in directed graphs, Symposium on Theory of Computing (2007), pp. 165-178. (Pubitemid 47630733)
11. J. Chuzhoy and J. Naor, The hardness of metric labeling, Foundations of Computer Science (2004), pp. 108-114. (Pubitemid 40575272)
12. Y. Dinitz, N. Garg, and M. Goemans, On the single-source unsplittable flow problem, Combinatorica (1999), pp. 17-41.
13. G. Even, J. Naor, S. Rao, and B. Schieber, Divide-and-conquer approximation algorithms via spreading metrics, Journal of the ACM (2000), pp. 585-616.
14. J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar, An improved approximation algorithm for the 0-extension problem, Symposium on Discrete Algorithms (2003), pp. 257-265.
15. J. Fakcharoenphol, S. Rao, and K. Talwar, A tight bound on approximation arbitrary metric by tree metrics, Symposium on Theory of Computing (2003), pp. 448-455.
16. U. Feige and R. Krauthgamer, A poly logarithmic approximation of the minimum bisection, SIAM Journal on Computing, 31 (2002), pp. 1090-1118.
17. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman (1979).
18. A. Gupta and E. Tardos, Constant factor approximation algorithms for a class of classification problems, Symposium on Theory of Computing (2000), pp. 652-658.
19. J. Kleinberg, Approximation algorithms for disjoint paths problems, PhD dissertation, MIT (1996).
20. J. Kleinberg, Single-source unspittable flow, Foundations of Computer Science (1996), pp. 68-77.
21. J. Kleinberg and E. Tardos, Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields, Journal of the ACM (2002), pp. 616-639.
22. T. Leighton and S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, Journal of the ACM (1999), pp. 787-832.
23. J. Lenstra, D. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming (1990), pp. 259-271.
24. J. Naor and R. Schwartz, Balanced metric labeling, Symposium on Theory of Computing (2005), pp. 582-591. (Pubitemid 43098631)
25. H. Räcke, Minimizing congestion in general networks, Foundations of Computer Science (2003), pp. 43-52.
26. H. Räcke, Optimal hierarchical decompositions for congestion minimization in networks, Symposium on Theory of Computing (2008), pp. 255-264.
27. J. Schmidt, A. Siegel, and A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited dependence, SIAM Journal on Discrete Math (1995), pp. 223-250.
28. D. Shmoys and E. Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming (1993), pp. 461-474.