{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:08Z","timestamp":1752378008251,"version":"3.41.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1023\/a:1008764212265","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"231-245","source":"Crossref","is-referenced-by-count":9,"title":["Master-Slave Strategy and Polynomial Approximation"],"prefix":"10.1007","volume":"16","author":[{"given":"Laurent","family":"Alfandari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"271479_CR1","unstructured":"L. Alfandari, \u201cApproximation de probl\u00e8mes de couverture et de partitionnement de graphes,\u201d PhD Thesis, LAMSADE, Universit\u00e9 Paris-Dauphine."},{"key":"271479_CR2","first-page":"607","volume":"6","author":"L. Alfandari","year":"1999","unstructured":"L. Alfandari and V. Th. Paschos, \u201cApproximating the minimum-weight rooted spanning tree with depth two,\u201d ITOR 6, 1999, pp. 607\u2013622.","journal-title":"ITOR"},{"issue":"2","key":"271479_CR3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"B.B. Boppana","year":"1992","unstructured":"B.B. Boppana and M.M. Halld\u00f3rsson, \u201cApproximating maximum independent sets by excluding subgraphs,\u201d BIT, vol. 32, no. 2, pp. 180\u2013196, 1992.","journal-title":"BIT"},{"key":"271479_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"V. Chv\u00e1tal, \u201cA greedy-heuristic for the set covering problem,\u201d Math. of Oper. Res., vol. 4, pp. 233\u2013235, 1979.","journal-title":"Math. of Oper. Res."},{"key":"271479_CR5","doi-asserted-by":"crossref","unstructured":"P. Crescenzi and A. Panconesi, \u201cCompleteness in approximation classes,\u201d in Lecture Notes in Computer Science, vol. 380: Proc. of Fundamentals of Computation Theory, Springer Verlag, 1989, pp. 116-126.","DOI":"10.1007\/3-540-51498-8_11"},{"key":"271479_CR6","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, \u201cComputers and Intractability. A Guide to the Theory of NP-Completeness,\u201d W.H. Freeman: San Francisco, 1979."},{"key":"271479_CR7","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson, \u201cApproximation algorithms for combinatorial problems,\u201d J. Comput. System Sci., vol. 9, pp. 256\u2013278, 1974.","journal-title":"J. Comput. System Sci."},{"key":"271479_CR8","unstructured":"D.S. Johnson, \u201cWorst-case behavior of graph-coloring algorithms,\u201d in Proc. South-Eastern Conference on Combinatorics, Graph Theory and Computing, 1974, p. 513-528."},{"issue":"1","key":"271479_CR9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal, \u201cOn the shortest spanning subtree of a graph and the traveling salesman problem,\u201d Proc. Amer. Math. Soc., vol. 7, no. 1, pp. 48\u201350, 1956.","journal-title":"Proc. Amer. Math. Soc."},{"key":"271479_CR10","unstructured":"M. Minoux, \u201cSome combinatorial optimization problems from VLSI-design,\u201d in Research Seminar \u201cOptimization\u201d, Universit\u00e9 Paris I, 1991."},{"key":"271479_CR11","doi-asserted-by":"crossref","unstructured":"A. Panconesi and D. Ranjan, \u201cQuantifiers and approximation,\u201d in Proc. STOC'90, 1990, pp. 446-456.","DOI":"10.1145\/100216.100275"},{"issue":"2","key":"271479_CR12","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0403025","volume":"3","author":"H.U. Simon","year":"1990","unstructured":"H.U. Simon, \u201cOn approximate solutions for combinatorial optimization problems,\u201d SIAM J. Disc. Math., vol. 3, no. 2, pp. 294\u2013310, 1990.","journal-title":"SIAM J. Disc. Math."},{"key":"271479_CR13","doi-asserted-by":"crossref","unstructured":"P. Slav\u00edk, \u201cA tight analysis of the greedy algorithm for set cover,\u201d in Proc. STOC'96, 1996, pp. 435-441.","DOI":"10.1145\/237814.237991"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008764212265.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008764212265\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008764212265.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:22:47Z","timestamp":1752376967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008764212265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["271479"],"URL":"https:\/\/doi.org\/10.1023\/a:1008764212265","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}