Improved bounds for planar \(k\)-sets and related problems
From MaRDI portal
Publication:1387847
DOI10.1007/PL00009354zbMath0899.68107WikidataQ29393621 ScholiaQ29393621MaRDI QIDQ1387847
Publication date: 8 June 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS, The \(k\)-centrum multi-facility location problem, Entering and leaving \(j\)-facets, Continuous location of dimensional structures., A successful concept for measuring non-planarity of graphs: The crossing number., Sorting weighted distances with applications to objective function evaluations in single facility location problems., Efficient searching with linear constraints, Monotone paths in line arrangements, A lower bound on the number of triangulations of planar point sets, On some monotone path problems in line arrangements