{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T03:51:08Z","timestamp":1672545068506},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,10,15]],"date-time":"2008-10-15T00:00:00Z","timestamp":1224028800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00454-008-9114-6","type":"journal-article","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T15:36:35Z","timestamp":1223998595000},"page":"595-621","source":"Crossref","is-referenced-by-count":8,"title":["Minimizing the Stabbing Number of Matchings, Trees, and Triangulations"],"prefix":"10.1007","volume":"40","author":[{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[]},{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,15]]},"reference":[{"issue":"3","key":"9114_CR1","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0221035","volume":"21","author":"P.K. Agarwal","year":"1992","unstructured":"Agarwal, P.K.: Ray shooting and other applications of spanning trees with low stabbing number. SIAM J. Comput. 21(3), 540\u2013570 (1992)","journal-title":"SIAM J. Comput."},{"key":"9114_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Aronov, B., Suri, S.: Stabbing triangulations by lines in 3D. In: Proc. 11th ACM Sympos. Computational Geometry, pp. 267\u2013276 (1995)","DOI":"10.1145\/220279.220308"},{"key":"9114_CR3","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"E.M. Arkin","year":"2005","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. SIAM J. Comput. 35, 531\u2013566 (2005)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9114_CR4","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/PL00009436","volume":"21","author":"B. Aronov","year":"1999","unstructured":"Aronov, B., Fortune, S.: Approximating minimum-weight triangulations in three dimensions. Discrete Comput. Geom. 21(4), 527\u2013549 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"9114_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.comgeo.2004.07.005","volume":"31","author":"B. Aronov","year":"2005","unstructured":"Aronov, B., Br\u00f6nnimann, H., Chang, A.Y., Chiang, Y.-J.: Cost-driven octree construction schemes: an experimental study. Comput. Geom. Theory Appl. 31, 127\u2013148 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9114_CR6","first-page":"467","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in space of finite vc-dimension. DISCG 4, 467\u2013489 (1989)","journal-title":"DISCG"},{"issue":"4","key":"9114_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(94)90129-5","volume":"52","author":"M. Berg de","year":"1994","unstructured":"de Berg, M., van Kreveld, M.: Rectilinear decompositions with low stabbing number. Inf. Process. Lett. 52(4), 215\u2013221 (1994)","journal-title":"Inf. Process. Lett."},{"key":"9114_CR8","unstructured":"Demaine, E.D., Mitchell, J.S.B., O\u2019Rourke, J.: The open problems project. http:\/\/cs.smith.edu\/~orourke\/TOPP\/Welcome.html (2003)"},{"key":"9114_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Natl. Burean Stand. 69B, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Burean Stand."},{"key":"9114_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/PL00009492","volume":"23","author":"S.P. Fekete","year":"2000","unstructured":"Fekete, S.P.: On simple polygonalizations with optimal area. Discrete Comput. Geom. 23, 73\u2013110 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"9114_CR11","unstructured":"Fekete, S.P., L\u00fcbbecke, M.E., Meijer, H.: Minimizing the stabbing number of matchings, spanning trees, and triangulations. In Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pp. 430\u2013439 (2004)"},{"key":"9114_CR12","unstructured":"Fekete, S.P., L\u00fcbbecke, M.E., Meijer, H.: Computing structures of minimum stabbing number. Technical report (2008)"},{"key":"9114_CR13","volume-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability\u2014A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9114_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"9114_CR15","unstructured":"Held, M., Klosowski, J.T., Mitchell, J.S.B.: Evaluation of collision detection methods for virtual reality fly-throughs. In: Proc. 7th Canadian Conf. Computational Geometry, pp. 205\u2013210 (1995)"},{"key":"9114_CR16","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms 18, 403\u2013431 (1995)","journal-title":"J. Algorithms"},{"issue":"1","key":"9114_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"9114_CR18","unstructured":"Jain, K.: Personal communication (2003)"},{"key":"9114_CR19","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","volume-title":"Network Models","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol. 7, pp. 503\u2013616. North-Holland, Amsterdam (1995)"},{"key":"9114_CR20","first-page":"102","volume":"25","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Spanning trees with low crossing number. Inf. Theor. Appl. 25, 102\u2013123 (1991)","journal-title":"Inf. Theor. Appl."},{"issue":"5","key":"9114_CR21","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1142\/S0218195901000651","volume":"11","author":"J.S.B. Mitchell","year":"2001","unstructured":"Mitchell, J.S.B., O\u2019Rourke, J.: Computational geometry column 42. Int. J. Comput. Geom. Appl. 11(5), 573\u2013582 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9114_CR22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M. Padberg","year":"1982","unstructured":"Padberg, M., Rao, M.R.: Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67\u201380 (1982)","journal-title":"Math. Oper. Res."},{"key":"9114_CR23","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"issue":"3","key":"9114_CR24","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s00454-004-1095-5","volume":"32","author":"J.R. Shewchuk","year":"2004","unstructured":"Shewchuk, J.R.: Stabbing Delaunay tetrahedralizations. Discrete Comput. Geom. 32(3), 339\u2013343 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"9114_CR25","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/11534273_23","volume-title":"Proc. 9th International Workshop on Algorithms and Data Structures (WADS 2005)","author":"C. T\u00f3th","year":"2005","unstructured":"T\u00f3th, C.: Orthogonal subdivisions with low stabbing numbers. In: Proc. 9th International Workshop on Algorithms and Data Structures (WADS 2005). LNCS, vol. 3608, pp. 256\u2013268. Springer, Berlin (2005)"},{"key":"9114_CR26","series-title":"LNCS","volume-title":"Data Structures and Efficient Algorithms","author":"E. Welzl","year":"1992","unstructured":"Welzl, E.: On spanning trees with low crossing numbers. In: Monien, B., Ottmann, T. (eds.) Data Structures and Efficient Algorithms. LNCS, vol. 594. Springer, Berlin (1992)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9114-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-008-9114-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9114-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:35Z","timestamp":1559072855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-008-9114-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,15]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9114"],"URL":"https:\/\/doi.org\/10.1007\/s00454-008-9114-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,15]]}}}