{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:50Z","timestamp":1725862730554},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_26","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:49:58Z","timestamp":1470642598000},"page":"334-346","source":"Crossref","is-referenced-by-count":1,"title":["Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivo","family":"Hedtke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tilo","family":"Wiedera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: Simplified $$O(n)$$ planarity by edge addition. J. Graph Algorithms Appl. 8(2), 241\u2013273 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jagm.1997.0920","volume":"27","author":"G C\u0103linescu","year":"1998","unstructured":"C\u0103linescu, G., Fernandes, C., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. J. Algorithms 27, 269\u2013302 (1998)","journal-title":"J. Algorithms"},{"key":"26_CR3","unstructured":"Cimikowski, R.: Graph planarization and skewness (unpublished). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.68.9958"},{"key":"26_CR4","unstructured":"Cimikowski, R.J.: An analysis of some heuristics for the maximum planar subgraph problem. In: Clarkson, K.L. (ed.) Proceedings of 6th SODA, pp. 322\u2013331 (1995)"},{"issue":"8","key":"26_CR5","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1109\/43.85735","volume":"10","author":"J Cong","year":"1991","unstructured":"Cong, J., Liu, C.: On the $$k$$ -layer planar subset and topological via minimization problems. IEEE Trans. CAD Integr. Circ. Syst. 10(8), 972\u2013981 (1991)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"issue":"1","key":"26_CR6","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0377-2217(85)90288-7","volume":"20","author":"M Dyer","year":"1985","unstructured":"Dyer, M., Foulds, L., Frieze, A.: Analysis of heuristics for finding a maximum weight planar subgraph. Eur. J. Oper. Res. 20(1), 102\u2013114 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR7","volume-title":"Handbook of Approximation Algorithms and Metaheur","author":"CG Fernandes","year":"2007","unstructured":"Fernandes, C.G., C\u0103linescu, G.: Maximum planar subgraph. In: Gonzalez, T. (ed.) Handbook of Approximation Algorithms and Metaheur. Chapman & Hall\/CRC, Boca Raton (2007)"},{"issue":"4","key":"26_CR8","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"JE Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/11533719_80","volume-title":"Computing and Combinatorics","author":"W-L Hsu","year":"2005","unstructured":"Hsu, W.-L.: A linear time algorithm for finding a maximal planar subgraph based on PC-trees. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 787\u2013797. Springer, Heidelberg (2005)"},{"key":"26_CR10","unstructured":"Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. In: Proceedings of 10th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congress Numbers XXIII-XXIV, pp. 727\u2013738. Utilitas Mathematica, Winnipeg, Manitoba (1979)"},{"issue":"3","key":"26_CR11","first-page":"503","volume":"18","author":"T Poranen","year":"2008","unstructured":"Poranen, T.: Two new approximation algorithms for the maximum planar subgraph problem. Acta Cybern. 18(3), 503\u2013527 (2008)","journal-title":"Acta Cybern."},{"issue":"1\u20132","key":"26_CR12","first-page":"179","volume":"223","author":"W Shih","year":"1999","unstructured":"Shih, W., Hsu, W.: A new planarity test. Theor. Comput. Sci. 223(1\u20132), 179\u2013191 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR13","unstructured":"Zelikovsky, A.: Improved approximations of maximum planar subgraph (unpublished). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.71.304"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:11:14Z","timestamp":1498320674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}