NDLI: Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

Content Provider	Springer Nature Link
Author	Fekete, Sándor P. Lübbecke, Marco E. Meijer, Henk
Copyright Year	2008
Abstract	The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or triangulations of minimum stabbing number for a given set of vertices. The complexity of finding a spanning tree of minimum stabbing number is one of the original 30 questions on “The Open Problems Project” list of outstanding problems in computational geometry by Demaine, Mitchell, and O’Rourke.We show $\mathcal{N}\mathcal{P}$ -hardness of stabbing problems by means of a general proof technique. For matchings, this also implies a nontrivial lower bound on the approximability. On the positive side, we propose a cut-based integer programming formulation for minimizing the stabbing number of matchings and spanning trees. From the corresponding linear programming relaxation we obtain polynomial-time lower bounds and show that there always is an optimal fractional solution that contains an edge of at least constant weight. We conjecture that the resulting iterated rounding scheme constitutes a constant-factor approximation algorithm.
Starting Page	595
Ending Page	621
Page Count	27
File Format	PDF
ISSN	01795376
Journal	Discrete & Computational Geometry
Volume Number	40
Issue Number	4
e-ISSN	14320444
Language	English
Publisher	Springer-Verlag
Publisher Date	2008-10-15
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Stabbing number Matching Spanning tree Triangulation Complexity Linear programming relaxation Iterated rounding Computational Mathematics and Numerical Analysis Combinatorics
Content Type	Text
Resource Type	Article
Subject	Discrete Mathematics and Combinatorics Theoretical Computer Science Computational Theory and Mathematics Geometry and Topology

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Minimizing the stabbing number of matchings, trees, and triangulations

Minimizing the stabbing number of matchings, trees, and triangulations (2003).

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations (2003)

Counting Triangulations and Other Crossing-Free Structures via Onion Layers

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

Minimizing the stabbing number of matchings, trees, and triangulations (2008).

Minimizing the stabbing number of matchings, trees, and triangulations

A Monotonicity Property for Weighted Delaunay Triangulations

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

Similar Documents

Minimizing the stabbing number of matchings, trees, and triangulations

Minimizing the stabbing number of matchings, trees, and triangulations (2003).

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations (2003)

Counting Triangulations and Other Crossing-Free Structures via Onion Layers

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations

Minimizing the stabbing number of matchings, trees, and triangulations (2008).

Minimizing the stabbing number of matchings, trees, and triangulations

A Monotonicity Property for Weighted Delaunay Triangulations

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations