{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:53:03Z","timestamp":1783036383410,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540291183","type":"print"},{"value":"9783540319511","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_41","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"448-459","source":"Crossref","is-referenced-by-count":42,"title":["Efficient Approximation Schemes for Geometric Problems?"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3-4","key":"41_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom.\u00a011(3-4), 209\u2013218 (1998)","journal-title":"Comput. Geom."},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms\u00a052(2), 134\u2013151 (2004)","journal-title":"J. Algorithms"},{"key":"41_CR3","first-page":"2","volume-title":"FOCS 1996","author":"S. Arora","year":"1996","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: FOCS 1996, pp. 2\u201311. IEEE Comput. Soc. Press, Los Alamitos (1996)"},{"issue":"5","key":"41_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"41_CR5","unstructured":"Bazgan, C.: Sch\u00e9mas d\u2019approximation et complexit\u00e9 param\u00e9tr\u00e9e. Technical report, Universit\u00e9 Paris Sud (1995)"},{"issue":"4","key":"41_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(97)00164-6","volume":"64","author":"M. Cesati","year":"1997","unstructured":"Cesati, M., Trevisan, L.: On the efficiency of polynomial time approximation schemes. Inform. Process. Lett.\u00a064(4), 165\u2013171 (1997)","journal-title":"Inform. Process. Lett."},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G.: Parameterized complexity for the skeptic. In: Proceedings of the 18th IEEE Annual Conference on Computational Complexity, pp. 147\u2013169 (2003)","DOI":"10.1109\/CCC.2003.1214417"},{"key":"41_CR8","volume-title":"Monographs in Computer Science","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. In: Monographs in Computer Science. Springer, New York (1999)"},{"key":"41_CR9","first-page":"671","volume-title":"SODA 2001","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: SODA 2001, pp. 671\u2013679. SIAM, Philadelphia (2001)"},{"issue":"1","key":"41_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"41_CR11","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt III","year":"1998","unstructured":"Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"key":"41_CR12","unstructured":"Malesi\u0144ska, E.: Graph-Thoretical Models for Frequency Assignment Problems. PhD thesis, Technical University of Berlin (1997)"},{"issue":"3","key":"41_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ipl.2004.10.003","volume":"93","author":"L. Sunil Chandran","year":"2005","unstructured":"Sunil Chandran, L., Grandoni, F.: Refined memorization for vertex cover. Inform. Process. Lett.\u00a093(3), 125\u2013131 (2005)","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"41_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(88)90174-3","volume":"28","author":"D.W. Wang","year":"1988","unstructured":"Wang, D.W., Kuo, Y.-S.: A study on two geometric location problems. Inform. Process. Lett.\u00a028(6), 281\u2013286 (1988)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:31Z","timestamp":1619507611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11561071_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}