Lower bounds for covering problems

DOI10.1023/A:1015670603203zbMath1021.90045OpenAlexW1547480733MaRDI QIDQ1868261

Michael Segal

Publication date: 27 April 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015670603203

zbMATH Keywords

reductionlower boundsmax-gap problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Square and Rectangle Covering with Outliers ⋮ Optimizing Squares Covering a Set of Points ⋮ Covering points by disjoint boxes with outliers ⋮ BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES ⋮ Optimizing squares covering a set of points ⋮ Minimum perimeter-sum partitions in the plane

This page was built for publication: Lower bounds for covering problems