Conversion of coloring algorithms into maximum weight independent set algorithms

Discrete Applied Mathematics

Volumn 148, Issue 1, 2005, Pages 107-125

  Erlebach, Thomas ^a   Jansen, Klaus ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation algorithms; Edge disjoint paths; Linear programming; Path coloring; Time constrained packet scheduling; Weighted independent set

Indexed keywords

APPROXIMATION THEORY; COLORING; GRAPH THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY; TOPOLOGY; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; EDGE-DISJOINT PATHS; PATH COLORING; TIME-CONSTRAINED PACKET SCHEDULING; WEIGHTED INDEPENDENT SET;

ALGORITHMS;

EID: 15344343196     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.11.007     Document Type: Article

References (35)

1. M. Adler, S. Khanna, R. Rajaraman, and A. Rosén Time-constrained scheduling of weighted packets on trees and meshes Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'99) 1999 1 12
2. M. Adler, A.L. Rosenberg, R.K. Sitaraman, and W. Unger Scheduling time-constrained communication in linear networks Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'98) 1998 269 278
3. S. Arnborg, and A. Proskurowski Linear time algorithms for NP-hard problems restricted to partial k-trees Discrete Appl. Math. 23 1989 11 24
4. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J.S. Naor, and B. Schieber A unified approach to approximating resource allocation and scheduling J. ACM 48 5 2001 1069 1090
5. A. Bar-Noy, S. Guha, J.S. Naor, and B. Schieber Approximating the throughput of multiple machines in real-time scheduling SIAM J. Comput. 31 2 2001 331 352
6. P. Berman, and B. DasGupta Multi-phase algorithms for throughput maximization for real-time scheduling J. Combin. Optim. 4 3 2000 307 323
7. P. Berman, T. Fujito, On the approximation properties of independent set problem in degree 3 graphs, in: Proceedings of the Fourth International Workshop on Algorithms and Data Structures (WADS'95), Lecture Notes in Computer Science, vol. 955, Springer, Berlin, 1995, pp. 449-460.
8. T. Erlebach, Scheduling connections in fast networks, Ph.D. Thesis, Technische Universität München, 1999.
9. T. Erlebach, and K. Jansen The maximum edge-disjoint paths problem in bidirected trees SIAM J. Discrete Math. 14 3 2001 326 355
10. T. Erlebach, and K. Jansen Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees ACM J. Exp. Algorithmics 7 2002
11. T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano Optimal wavelength routing on directed fiber trees (special issue of ICALP'97) Theoret. Comput. Sci. 221 1999 119 137
12. U. Feige, and J. Kilian Zero knowledge and the chromatic number J. Comput. System Sci. 57 2 1998 187 199
13. M.R. Garey, and D.S. Johnson Computers and Intractability. A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York, San Francisco
14. M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou The complexity of coloring circular arcs and chords SIAM J. Algebraic Discrete Methods 1 2 1980 216 227
15. M.C. Golumbic, and R.E. Jamison Edge and vertex intersection of paths in a tree Discrete Math. 55 1985 151 159
16. M. Grötschel, L. Lovász, and A. Schrijver The ellipsoid method and its consequences in combinatorial optimization Combinatorica 1 1981 169 197 (corrigendum in Combinatorica 4, 291-295)
17. M. Grötschel, L. Lovász, and A. Schrijver Geometric Algorithms and Combinatorial Optimization 1988 Springer Berlin
18. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC'99) 1999 19 28
19. M.M. Halldórsson, Approximations of independent sets in graphs, in: Proceedings of the First International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'98), Lecture Notes in Computer Science, vol. 1444, Springer, Berlin, 1998, pp. 1-13.
20. M.M. Halldórsson, Approximations of weighted independent set and hereditary subset problems, in: Proceedings of the Fifth International Computing and Combinatorics Conference (COCOON'99), Lecture Notes in Computer Science, vol. 1627, Springer, Berlin, 1999, pp. 261-270.
21. J. Håstad Clique is hard to approximate within n 1 - ε Acta Math. 182 1999 105 142
22. D. Kagaris, and S. Tragoudas Maximum weighted independent sets on transitive graphs and applications Integration 27 1999 77 86
23. V. Kann Maximum bounded 3-dimensional matching is MAX SNP-complete Inform. Process. Lett. 37 1991 27 35
24. J. Kleinberg, Approximation algorithms for disjoint paths problems, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1996.
25. J. Kleinberg, and É. Tardos Disjoint paths in densely embedded graphs Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95) 1995 52 61
26. S.G. Kolliopoulos, C. Stein, Approximating disjoint-path problems using greedy algorithms and packing integer programs, in: Proceedings of the Sixth Integer Programming and Combinatorial Optimization Conference (IPCO VI), Lecture Notes in Computer Science, vol. 1412, Springer, Berlin, 1998, pp. 153-168.
27. L. Lovász On the ratio of the optimal integral and fractional covers Discrete Math. 13 1975 383 390
28. C. Lund, and M. Yannakakis On the hardness of approximating minimization problems J. ACM 41 5 1994 960 981
29. E. Malesińska, Graph-theoretical models for frequency assignment problems, Ph.D. Thesis, Technische Universität Berlin, 1997.
30. C. Papadimitriou, and M. Yannakakis Optimization, approximization and complexity classes J. Comput. System Sci. 43 1991 425 440
31. F. Spieksma, Approximating an interval scheduling problem, in: Proceedings of the First International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'98), Lecture Notes in Computer Science, vol. 1444, Springer, Berlin, 1998, pp. 169-180.
32. A. Srinivasan Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS'97) 1997 416 425
33. R.E. Tarjan Decomposition by clique separators Discrete Math. 55 1985 221 232
34. A. Tucker Coloring a family of circular arcs SIAM J. Appl. Math. 29 3 1975 493 502
35. B. Verweij, K. Aardal, An optimisation algorithm for maximum independent set with applications in map labelling, in: Proceedings of the Seventh Annual European Symposium on Algorithms (ESA'99), Lecture Notes in Computer Science, vol. 1643, Springer, Berlin, 1999, pp. 426-437.