Geometric Lower Bounds for Parametric Matroid Optimization

1998/12/01 by David Eppstein, D. Eppstein · 4 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Discrete mathematics #Geometry #Graphic matroid #Mathematics #Matroid #Matroid partitioning #Optimization and Packing Problems #Oriented matroid #Parametric statistics #Rank (graph theory) #Regular polygon #Upper and lower bounds #Weighted matroid

paper · pdf · doi:10.1007/pl00009396

crossref issued 1998/12/01 · crossref published 1998/12/01 · crossref published-print 1998/12/01 · openalex publication_date 1998/12/01 · crossref created 2006/02/17 · crossref deposited 2019/05/22 · crossref indexed 2025/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Constructing Belts in Two-Dimensional Arrangements with Applications
• On k-Hulls and Related Problems
• Combinatorial complexity bounds for arrangements of curves and spheres
• The complexity and construction of many faces in arrangements of lines and of segments

Cited by

• A Stronger Lower Bound on Parametric Minimum Spanning Trees
• On Levels in Arrangements of Curves
• On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
• K-set (geometry) [wikipedia]