Vertex cover in graphs with locally few colors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6755 LNCS, Issue PART 1, 2011, Pages 498-509

  Kuhn, Fabian ^a   Mastrolilli, Monaldo ^b  

^a UNIVERSITY OF LUGANO   (Switzerland)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

approximation; local coloring; scheduling; vertex cover

Indexed keywords

ADJACENT VERTICES; APPROXIMATION; APPROXIMATION RATIOS; BICLIQUE; BOUNDED COLORING; BOUNDED DEGREE GRAPHS; CHROMATIC NUMBER; COLORABILITY; COMPLETE BIPARTITE GRAPHS; DIMENSION THEORY; INAPPROXIMABILITY; LOCAL CHROMATIC NUMBER; LOCAL COLORING; MINIMUM WEIGHTED VERTEX COVER; PARTIAL ORDER; RANDOMIZED ALGORITHMS; SCHEDULING PROBLEM; SINGLE MACHINE SCHEDULING PROBLEMS; TOTAL WEIGHTED COMPLETION TIME; TWO-COLOR; UNIQUE GAMES; UPPER BOUND; VERTEX COVER; VERTEX COVER PROBLEMS;

APPROXIMATION ALGORITHMS; COLOR; COLORING; GRAPHIC METHODS;

GRAPH THEORY;

EID: 79959935820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22006-7_42     Document Type: Conference Paper

References (33)

1. Ambühl, C., Mastrolilli, M.: Single machine precedence constrained scheduling is a vertex cover problem. Algorithmica 53(4), 488-503 (2009)
2. Ambühl, C., Mastrolilli, M., Mutsanas, N., Svensson, O.: Scheduling with precedence constraints of low fractional dimension. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 130-144. Springer, Heidelberg (2007)
3. Ambühl, C., Mastrolilli, M., Svensson, O.: Approximating precedence-constrained single machine scheduling by coloring. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 15-26. Springer, Heidelberg (2006)
4. Ambühl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. In: FOCS, pp. 329-337 (2007)
5. Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: IEEE Conference on Computational Complexity, pp. 74-80 (2009)
6. Bansal, N., Khot, S.: Optimal Long-Code test with one free bit. In: Foundations of Computer Science (FOCS), pp. 453-462 (2009)
7. Brightwell, G.R., Scheinerman, E.R.: Fractional dimension of partial orders. Order 9, 139-158 (1992)
8. Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics 98(1-2), 29-38 (1999)
9. Chudak, F.A., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters 25, 199-204 (1999)
10. Correa, J.R., Schulz, A.S.: Single machine scheduling with precedence constraints. Mathematics of Operations Research 30(4), 1005-1021 (2005)
11. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1), 439-485 (2005)
12. Dushnik, B., Miller, E.: Partially ordered sets. American Journal of Mathematics 63, 600-610 (1941)
13. Erdös, P., Füredi, Z., Hajnal, A., Komjáth, P., Rödl, V., Seress, Á.: Coloring graphs with locally few colors. Discrete Mathematics 59(1-2), 21-34 (1986)
14. Felsner, Trotter: On the fractional dimension of partially ordered sets. DMATH: Discrete Mathematics 136, 101-117 (1994)
15. Felsner, S., Trotter, W.T.: Dimension, graph and hypergraph coloring. Order 17(2), 167-177 (2000)
16. Graham, R., Lawler, E., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, vol. 5, pp. 287-326. North-Holland, Amsterdam (1979)
17. Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line algorithms. Mathematics of Operations Research 22, 513-544 (1997)
18. Halldórsson,M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145-163 (1997)
19. Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31(5), 1608-1623 (2002)
20. Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6, 243-254 (1983)
21. Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Transactions on Algorithms 5(4) (2009)
22. Karger, D.R., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. J. ACM 45(2), 246-265 (1998)
23. Khot, S.: On the power of unique 2-prover 1-round games. In: STOC, pp. 767-775 (2002)
24. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- epsilon. J. Comput. Syst. Sci. 74(3), 335-349 (2008)
25. Kleinberg, J.M., Goemans, M.X.: The lovász theta function and a semidefinite programming relaxation of vertex cover. SIAM J. Discrete Math. 11(2), 196-204 (1998)
26. Körner, J., Pilotto, C., Simonyi, G.: Local chromatic number and Sperner capacity. Journal on Combinatorial Theory, Series B 95(1), 101-117 (2005)
27. Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics 2, 75-90 (1978)
28. Lenstra, J.K., Rinnooy Kan, A.H.G.: The complexity of scheduling under precedence constraints. Operations Research 26, 22-35 (1978)
29. Margot, F., Queyranne,M.,Wang, Y.: Decompositions, network flows and a precedence constrained single machine scheduling problem. Operations Research 51(6), 981-992 (2003)
30. Nemhauser, G.L., Trotter, L.E.: Vertex packings: Structural properties and algorithms. Mathematical Programming 8, 232-248 (1975)
31. Potts, C.N.: An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Study 13, 78-87 (1980)
32. Schulz, A.S.: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 301-315. Springer, Heidelberg (1996)
33. Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling 2(5), 203-213 (1999)