{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:27:24Z","timestamp":1758266844686},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_45","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T09:41:33Z","timestamp":1155634893000},"page":"428-438","source":"Crossref","is-referenced-by-count":14,"title":["Approximating Min-Max (Regret) Versions of Some Polynomial Problems"],"prefix":"10.1007","author":[{"given":"Hassene","family":"Aissi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina","family":"Bazgan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Vanderpooten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1976","unstructured":"Aho, A.V., Hopcroft, J.E., Ullmann, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1976)"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/11561071_76","volume-title":"Algorithms \u2013 ESA 2005","author":"H. Aissi","year":"2005","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 862\u2013873. Springer, Heidelberg (2005)"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(87)90067-9","volume":"16","author":"F. Barahona","year":"1987","unstructured":"Barahona, F., Pulleyblank, R.: Exact arborescences, matching and cycles. Discrete Applied Mathematics\u00a016, 91\u201399 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J.: System of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards\u00a071, 241\u2013245 (1967)","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"3","key":"45_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","volume":"32","author":"S.P. Hong","year":"2004","unstructured":"Hong, S.P., Chung, S.J., Park, B.H.: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters\u00a032(3), 233\u2013239 (2004)","journal-title":"Operations Research Letters"},{"key":"45_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Boston (1997)"},{"unstructured":"Mahajan, M., Vinay, V.: A combinatorial algorithm for the determinant. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), New Orleans, USA, pp. 730\u2013738 (1997)","key":"45_CR7"},{"key":"45_CR8","volume-title":"Computational complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison Wesley, Reading (1994)"},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: IEEE Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, USA, pp. 86\u201392 (2000)","key":"45_CR9","DOI":"10.1109\/SFCS.2000.892068"},{"key":"45_CR10","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Graph Theory","author":"W.T. Tutte","year":"1984","unstructured":"Tutte, W.T.: Graph Theory. Encyclopedia of Mathematics and its Applications, vol.\u00a021. Addison-Wesley, Reading (1984)"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of Pareto optima in multiple-objective, shortest-path problems. Operations Research\u00a035, 70\u201379 (1987)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:26:41Z","timestamp":1619494001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11809678_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}