Minimizing the stabbing number of matchings, trees, and triangulations
DOI10.1007/S00454-008-9114-6zbMATH Open1167.90628OpenAlexW3137400503MaRDI QIDQ1006396FDOQ1006396
Authors: Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer 
Publication date: 24 March 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-008-9114-6
Recommendations
- scientific article; zbMATH DE number 6469175
- Integer programming approaches for minimum stabbing problems
- The minimum stabbing triangulation problem: IP models and computational evaluation
- Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
- Finding stabbing lines in 3-space
MatchingComplexityTriangulationSpanning treeIterated roundingLinear programming relaxationStabbing number
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- Odd Minimum Cut-Sets and b-Matchings
- Minimizing the stabbing number of matchings, trees, and triangulations
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Stabbing Delaunay tetrahedralizations
- Quasi-optimal range searching in spaces of finite VC-dimension
- Spanning trees with low crossing number
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Optimal Covering Tours with Turn Costs
- Algorithms and Data Structures
- Approximating minimum-weight triangulations in three dimensions
- Rectilinear decompositions with low stabbing number
- Cost-driven octree construction schemes: An experimental study
- On simple polygonalizations with optimal area
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Rectangularization of digital objects and its relation with straight skeletons
- The minimum stabbing triangulation problem: IP models and computational evaluation
- Partitions of rectilinear polygons with minimum stabbing number
- Minimizing the stabbing number of matchings, trees, and triangulations
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Minimum stabbing rectangular partitions of rectilinear polygons
Uses Software
This page was built for publication: Minimizing the stabbing number of matchings, trees, and triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006396)
