{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:03:45Z","timestamp":1725563025705},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148071"},{"type":"electronic","value":"9783642148088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14808-8_24","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T05:52:01Z","timestamp":1282369921000},"page":"352-366","source":"Crossref","is-referenced-by-count":3,"title":["A Class of Greedy Algorithms and Its Relation to Greedoids"],"prefix":"10.1007","author":[{"given":"Srinivas","family":"Nedunuri","sequence":"first","affiliation":[]},{"given":"Douglas R.","family":"Smith","sequence":"additional","affiliation":[]},{"given":"William R.","family":"Cook","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-57499-9_16","volume-title":"Formal Program Development","author":"R.S. Bird","year":"1993","unstructured":"Bird, R.S., De Moor, O.: From dynamic programming to greedy algorithms. In: M\u00f6ller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol.\u00a0755, pp. 43\u201361. Springer, Heidelberg (1993)"},{"key":"24_CR2","volume-title":"Matroid Applications","author":"A. Bj\u00f6rner","year":"1992","unstructured":"Bj\u00f6rner, A., Ziegler, G.M.: Introduction to greedoids. In: White, N. (ed.) Matroid Applications. Cambridge University Press, Cambridge (1992)"},{"key":"24_CR3","unstructured":"Charlier, B.: The greedy algorithms class: formalization, synthesis and generalization. Technical report (1995)"},{"key":"24_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"1-3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.scico.2003.09.001","volume":"49","author":"S.A. Curtis","year":"2003","unstructured":"Curtis, S.A.: The classification of greedy algorithms. Sci. Comput. Program\u00a049(1-3), 125\u2013157 (2003)","journal-title":"Sci. Comput. Program"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Programming\u00a01(1), 127\u2013136 (1971)","journal-title":"Math. Programming"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/0406021","volume":"6","author":"P. Helman","year":"1993","unstructured":"Helman, P., Moret, B.M.E., Shapiro, H.D.: An exact characterization of greedy structures. SIAM J. on Discrete Math.\u00a06, 274\u2013283 (1993)","journal-title":"SIAM J. on Discrete Math."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/322003.322010","volume":"24","author":"T. Ibaraki","year":"1977","unstructured":"Ibaraki, T.: The power of dominance relations in branch-and-bound algorithms. J. ACM\u00a024(2), 264\u2013279 (1977)","journal-title":"J. ACM"},{"key":"24_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58191-5","volume-title":"Greedoids","author":"B. Korte","year":"1991","unstructured":"Korte, B., Lovasz, L., Schrader, R.: Greedoids. Springer, Heidelberg (1991)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Nedunuri, S., Cook, W.R.: Synthesis of fast programs for maximum segment sum problems. In: Intl. Conf. on Generative Programming and Component Engineering (GPCE) (October 2009)","DOI":"10.1145\/1621607.1621626"},{"key":"24_CR11","unstructured":"Nedunuri, S., Smith, D.R., Cook, W.R.: Synthesis of greedy algorithms using dominance relations. In: 2nd NASA Symp. on Formal Methods (2010)"},{"key":"24_CR12","unstructured":"Smith, D.R.: Structure and design of global search algorithms. Tech. Rep. Kes.U.87.12, Kestrel Institute (1988)"},{"issue":"9","key":"24_CR13","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/32.58788","volume":"16","author":"D.R. Smith","year":"1990","unstructured":"Smith, D.R.: Kids: A semi-automatic program development system. IEEE Trans. on Soft. Eng., Spec. Issue on Formal Methods\u00a016(9), 1024\u20131043 (1990)","journal-title":"IEEE Trans. on Soft. Eng., Spec. Issue on Formal Methods"},{"key":"24_CR14","unstructured":"Smith, D.R., Parra, E.A., Westfold, S.J.: Synthesis of high-performance transportation schedulers. Technical report, Kestrel Institute (1995)"},{"key":"24_CR15","unstructured":"Smith, D.R., Westfold, S.: Synthesis of propositional satisfiability solvers. Final proj. report, Kestrel Institute (2008)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14808-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:57:47Z","timestamp":1606168667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14808-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642148071","9783642148088"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14808-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}