Geometric lower bounds for parametric matroid optimization
From MaRDI portal
Publication:1275670
DOI10.1007/PL00009396zbMath0915.05036OpenAlexW2021169414MaRDI QIDQ1275670
Publication date: 12 July 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009396
matroiduniform matroidsconvex polygons in line arrangementslower envelopes of line segmentsparametric graph minimum spanning trees
Combinatorial aspects of matroids and geometric lattices (05B35) Other problems of combinatorial convexity (52A37)
Related Items (5)
A stronger lower bound on parametric minimum spanning trees ⋮ The Parametric Closure Problem ⋮ PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ The \(k\)-centrum multi-facility location problem
This page was built for publication: Geometric lower bounds for parametric matroid optimization
