{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:49Z","timestamp":1759638409119},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_42","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"498-509","source":"Crossref","is-referenced-by-count":4,"title":["Vertex Cover in Graphs with Locally Few Colors"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monaldo","family":"Mastrolilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"42_CR1","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/s00453-008-9251-6","volume":"53","author":"C. Amb\u00fchl","year":"2009","unstructured":"Amb\u00fchl, C., Mastrolilli, M.: Single machine precedence constrained scheduling is a vertex cover problem. Algorithmica\u00a053(4), 488\u2013503 (2009)","journal-title":"Algorithmica"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-72792-7_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"C. Amb\u00fchl","year":"2007","unstructured":"Amb\u00fchl, 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.\u00a04513, pp. 130\u2013144. Springer, Heidelberg (2007)"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11830924_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Svensson, O.: Approximating precedence-constrained single machine scheduling by coloring. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 15\u201326. Springer, Heidelberg (2006)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. In: FOCS, pp. 329\u2013337 (2007)","DOI":"10.1109\/FOCS.2007.4389504"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"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\u201380 (2009)","DOI":"10.1109\/CCC.2009.38"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khot, S.: Optimal Long-Code test with one free bit. In: Foundations of Computer Science (FOCS), pp. 453\u2013462 (2009)","DOI":"10.1109\/FOCS.2009.23"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00814406","volume":"9","author":"G.R. Brightwell","year":"1992","unstructured":"Brightwell, G.R., Scheinerman, E.R.: Fractional dimension of partial orders. Order\u00a09, 139\u2013158 (1992)","journal-title":"Order"},{"issue":"1-2","key":"42_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0166-218X(98)00143-7","volume":"98","author":"C. Chekuri","year":"1999","unstructured":"Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics\u00a098(1-2), 29\u201338 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0167-6377(99)00056-5","volume":"25","author":"F.A. Chudak","year":"1999","unstructured":"Chudak, F.A., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters\u00a025, 199\u2013204 (1999)","journal-title":"Operations Research Letters"},{"issue":"4","key":"42_CR10","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1287\/moor.1050.0158","volume":"30","author":"J.R. Correa","year":"2005","unstructured":"Correa, J.R., Schulz, A.S.: Single machine scheduling with precedence constraints. Mathematics of Operations Research\u00a030(4), 1005\u20131021 (2005)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"42_CR11","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics\u00a0162(1), 439\u2013485 (2005)","journal-title":"Annals of Mathematics"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.: Partially ordered sets. American Journal of Mathematics\u00a063, 600\u2013610 (1941)","journal-title":"American Journal of Mathematics"},{"issue":"1-2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0012-365X(86)90065-8","volume":"59","author":"P. Erd\u00f6s","year":"1986","unstructured":"Erd\u00f6s, P., F\u00fcredi, Z., Hajnal, A., Komj\u00e1th, P., R\u00f6dl, V., Seress, \u00c1.: Coloring graphs with locally few colors. Discrete Mathematics\u00a059(1-2), 21\u201334 (1986)","journal-title":"Discrete Mathematics"},{"key":"42_CR14","first-page":"101","volume":"136","author":"Felsner","year":"1994","unstructured":"Felsner, Trotter: On the fractional dimension of partially ordered sets. DMATH: Discrete Mathematics\u00a0136, 101\u2013117 (1994)","journal-title":"DMATH: Discrete Mathematics"},{"issue":"2","key":"42_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1006429830221","volume":"17","author":"S. Felsner","year":"2000","unstructured":"Felsner, S., Trotter, W.T.: Dimension, graph and hypergraph coloring. Order\u00a017(2), 167\u2013177 (2000)","journal-title":"Order"},{"key":"42_CR16","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","author":"R. Graham","year":"1979","unstructured":"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.\u00a05, pp. 287\u2013326. North-Holland, Amsterdam (1979)"},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L.A. Hall","year":"1997","unstructured":"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\u00a022, 513\u2013544 (1997)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"42_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica\u00a018(1), 145\u2013163 (1997)","journal-title":"Algorithmica"},{"issue":"5","key":"42_CR19","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E. Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput.\u00a031(5), 1608\u20131623 (2002)","journal-title":"SIAM J. Comput."},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"D.S. Hochbaum","year":"1983","unstructured":"Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics\u00a06, 243\u2013254 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Transactions on Algorithms 5(4) (2009)","DOI":"10.1145\/1597036.1597045"},{"issue":"2","key":"42_CR22","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D.R. Karger","year":"1998","unstructured":"Karger, D.R., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. J. ACM\u00a045(2), 246\u2013265 (1998)","journal-title":"J. ACM"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: STOC, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"issue":"3","key":"42_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci.\u00a074(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"42_CR25","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/S0895480195287541","volume":"11","author":"J.M. Kleinberg","year":"1998","unstructured":"Kleinberg, J.M., Goemans, M.X.: The lov\u00e1sz theta function and a semidefinite programming relaxation of vertex cover. SIAM J. Discrete Math.\u00a011(2), 196\u2013204 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"42_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.jctb.2005.03.006","volume":"95","author":"J. K\u00f6rner","year":"2005","unstructured":"K\u00f6rner, J., Pilotto, C., Simonyi, G.: Local chromatic number and Sperner capacity. Journal on Combinatorial Theory, Series B\u00a095(1), 101\u2013117 (2005)","journal-title":"Journal on Combinatorial Theory, Series B"},{"key":"42_CR27","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E.L. Lawler","year":"1978","unstructured":"Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics\u00a02, 75\u201390 (1978)","journal-title":"Annals of Discrete Mathematics"},{"key":"42_CR28","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J.K. Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: The complexity of scheduling under precedence constraints. Operations Research\u00a026, 22\u201335 (1978)","journal-title":"Operations Research"},{"issue":"6","key":"42_CR29","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1287\/opre.51.6.981.24912","volume":"51","author":"F. Margot","year":"2003","unstructured":"Margot, F., Queyranne, M., Wang, Y.: Decompositions, network flows and a precedence constrained single machine scheduling problem. Operations Research\u00a051(6), 981\u2013992 (2003)","journal-title":"Operations Research"},{"key":"42_CR30","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: Structural properties and algorithms. Mathematical Programming\u00a08, 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"key":"42_CR31","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0120909","volume":"13","author":"C.N. Potts","year":"1980","unstructured":"Potts, C.N.: An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Study\u00a013, 78\u201387 (1980)","journal-title":"Mathematical Programming Study"},{"key":"42_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-61310-2_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"A.S. Schulz","year":"1996","unstructured":"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.\u00a01084, pp. 301\u2013315. Springer, Heidelberg (1996)"},{"issue":"5","key":"42_CR33","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling\u00a02(5), 203\u2013213 (1999)","journal-title":"Journal of Scheduling"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:47:44Z","timestamp":1560289664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}