{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:45Z","timestamp":1725470745762},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_6","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"28-39","source":"Crossref","is-referenced-by-count":8,"title":["Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Amb\u00fchl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monaldo","family":"Mastrolilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"Journal of the ACM"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"K.A. Baker","year":"1971","unstructured":"Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension 2. Networks\u00a02, 11\u201328 (1971)","journal-title":"Networks"},{"issue":"1-2","key":"6_CR3","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":"6_CR4","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"},{"key":"6_CR5","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, 1005\u20131021 (2005)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"6_CR6","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. Ann. of Math.\u00a0162(1)(2), 439\u2013485 (2005)","journal-title":"Ann. of Math."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/S0895480197330254","volume":"13","author":"M.X. Goemans","year":"2000","unstructured":"Goemans, M.X., Williamson, D.P.: Two-dimensional Gantt charts and a scheduling algorithm of Lawler. SIAM J. Discrete Math.\u00a013(3), 281\u2013294 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","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\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"6_CR9","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"},{"key":"6_CR10","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":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/3-540-45749-6_54","volume-title":"Algorithms - ESA 2002","author":"S.G. Kolliopoulos","year":"2002","unstructured":"Kolliopoulos, S.G., Steiner, G.: Partially-ordered knapsack and applications to scheduling. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 612\u2013624. Springer, Heidelberg (2002)"},{"key":"6_CR12","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":"6_CR13","first-page":"445","volume-title":"Handbooks in Operations Research and Management Science","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P. (eds.) Handbooks in Operations Research and Management Science, vol.\u00a04, pp. 445\u2013552. North-Holland, Amsterdam (1993)"},{"key":"6_CR14","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":"6_CR15","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":"6_CR16","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-009-2639-4_4","volume-title":"Algorithms and Order","author":"R.H. M\u00f6hring","year":"1989","unstructured":"M\u00f6hring, R.H.: Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 105\u2013193. Kluwer Academic Publishers, Dordrecht (1989)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G.L. Nemhauser","year":"1973","unstructured":"Nemhauser, G.L., Trotter, L.E.: Properties of vertex packing and independence system polyhedra. Mathematical Programming\u00a06, 48\u201361 (1973)","journal-title":"Mathematical Programming"},{"key":"6_CR18","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"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/254180.254190","volume":"29","author":"V.T. Paschos","year":"1997","unstructured":"Paschos, V.T.: A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys\u00a029(2), 171\u2013209 (1997)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/S0166-218X(03)00334-2","volume":"131","author":"N.N. Pisaruk","year":"2003","unstructured":"Pisaruk, N.N.: A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time. Discrete Applied Mathematics\u00a0131(3), 655\u2013663 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR21","doi-asserted-by":"crossref","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":"6_CR22","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (1996)"},{"issue":"5","key":"6_CR23","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"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1287\/opre.23.2.283","volume":"23","author":"J.B. Sidney","year":"1975","unstructured":"Sidney, J.B.: Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Research\u00a023, 283\u2013298 (1975)","journal-title":"Operations Research"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly\u00a03, 59\u201366 (1956)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.9.2.248","volume":"9","author":"G. Steiner","year":"1984","unstructured":"Steiner, G.: Single machine scheduling with precedence constraints of dimension 2. Mathematics of Operations Research\u00a09(2), 248\u2013259 (1984)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR27","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"W.T. Trotter","year":"1992","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. John Hopkins University Press, Baltimore (1992)"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(02)00427-4","volume":"131","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: On the approximability of average completion time scheduling under precedence constraints. Discrete Applied Mathematics\u00a0131(1), 237\u2013252 (2003)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T20:25:49Z","timestamp":1683577549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11841036_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}