{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:16:41Z","timestamp":1785543401154,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_48","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"528-539","source":"Crossref","is-referenced-by-count":47,"title":["Greedy in Approximation Algorithms"],"prefix":"10.1007","author":[{"given":"Juli\u00e1n","family":"Mestre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"48_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00453-004-1113-2","volume":"40","author":"S. Angelopoulos","year":"2004","unstructured":"Angelopoulos, S., Borodin, A.: The power of priority algorithms for facility location and set cover. Algorithmica\u00a040(4), 271\u2013291 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"48_CR2","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"E.M. Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On local search for weighted k-set packing. Mathematics of Operations Research\u00a023(3), 640\u2013648 (1998)","journal-title":"Mathematics of Operations Research"},{"key":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-58715-2_134","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"V. Arora","year":"1994","unstructured":"Arora, V., Vempala, S., Saran, H., Vazirani, V.V.: A limited-backtrack greedy schema for approximation algorithms. In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol.\u00a0880, pp. 318\u2013329. Springer, Heidelberg (1994)"},{"issue":"5","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J.S., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM\u00a048(5), 1069\u20131090 (2001)","journal-title":"Journal of the ACM"},{"issue":"4","key":"48_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-003-1036-3","volume":"37","author":"A. Borodin","year":"2003","unstructured":"Borodin, A., Nielsen, M.N., Rockoff, C.: (Incremental) Priority algorithms. Algorithmica\u00a037(4), 295\u2013326 (2003)","journal-title":"Algorithmica"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008610715466","volume":"8","author":"A.V. Borovik","year":"1998","unstructured":"Borovik, A.V., Gelfand, I., White, N.: Symplectic matroid. Journal of Algebraic Combinatorics\u00a08, 235\u2013252 (1998)","journal-title":"Journal of Algebraic Combinatorics"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02604639","volume":"38","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Greedy algorithm and symmetric matroids. Mathematical Programming\u00a038, 147\u2013159 (1987)","journal-title":"Mathematical Programming"},{"key":"48_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-540-45198-3_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"D.E. Drake","year":"2003","unstructured":"Drake, D.E., Hougardy, S.: Improved linear time approximation algorithms for weighted matchings. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 14\u201323. Springer, Heidelberg (2003)"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(02)00393-9","volume":"85","author":"D.E. Drake","year":"2003","unstructured":"Drake, D.E., Hougardy, S.: A simple approximation algorithm for the weighted matching problem. Information Processing Letters\u00a085, 211\u2013213 (2003)","journal-title":"Information Processing Letters"},{"key":"48_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Minimum partition of a matroid into independent subsets. J. of Research National Bureau of Standards\u00a069B, 67\u201377 (1965)","journal-title":"J. of Research National Bureau of Standards"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Mathematical Programming\u00a01, 36\u2013127 (1971)","journal-title":"Mathematical Programming"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: STOC, pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1002\/net.3230090406","volume":"9","author":"T.A. Jenkyns","year":"1979","unstructured":"Jenkyns, T.A.: The greedy travelling salesman\u2019s problem. Networks\u00a09, 363\u2013373 (1979)","journal-title":"Networks"},{"key":"48_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-5060(08)70322-4","volume":"2","author":"B. Korte","year":"1978","unstructured":"Korte, B., Hausmann, D.: An analysis of the greedy algorithm for independence systems. Ann. Disc. Math.\u00a02, 65\u201374 (1978)","journal-title":"Ann. Disc. Math."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Korte, B., Lov\u00e1sz, L.: Greedoids\u2014a structural framework for the greedy algorithm. In: Progress in Combinatorial Optimization, pp. 221\u2013243 (1984)","DOI":"10.1016\/B978-0-12-566780-7.50019-2"},{"key":"48_CR16","unstructured":"Lewenstein, M., Sviridenko, M.: Approximating asymmetric maximum TSP. In: SODA, pp. 646\u2013654 (2003)"},{"key":"48_CR17","unstructured":"Lov\u00e1sz, L.: The matroid matching problem. In: Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis Janos Bolyai (1978)"},{"key":"48_CR18","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"issue":"6","key":"48_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ipl.2004.05.007","volume":"91","author":"S. Pettie","year":"2004","unstructured":"Pettie, S., Sanders, P.: A simpler linear time 2\/3\u2009\u2212\u2009\u03b5 approximation to maximum weight matching. Information Processing Letters\u00a091(6), 271\u2013276 (2004)","journal-title":"Information Processing Letters"},{"key":"48_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","volume-title":"STACS 99","author":"R. Preis","year":"1999","unstructured":"Preis, R.: Linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 259\u2013269. Springer, Heidelberg (1999)"},{"key":"48_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/qmath\/os-13.1.83","volume":"13","author":"R. Rado","year":"1942","unstructured":"Rado, R.: A theorem on independence relations. Quart. J. Math.\u00a013, 83\u201389 (1942)","journal-title":"Quart. J. Math."},{"key":"48_CR22","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)"},{"issue":"1\u20133","key":"48_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0166-218X(01)00362-6","volume":"121","author":"A. Vince","year":"2002","unstructured":"Vince, A.: A framework for the greedy algorithm. Discrete Applied Mathematics\u00a0121(1\u20133), 247\u2013260 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"48_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney, H.: On the abstract properties of linear dependence. American Journal of Mathematic\u00a057, 509\u2013533 (1935)","journal-title":"American Journal of Mathematic"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:40:34Z","timestamp":1605624034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11841036_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}