On the p‐coverage problem on the real line

DOI10.1111/J.1467-9574.2007.00347.XMaRDI QIDQ5422012zbMATH OpenOpenAlexFDO

Authors Stan Van Hoesel, Albert P. M. Wagelmans

Publication date 26 October 2007

Published in Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1467-9574.2007.00347.x

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Sensitivity, stability, parametric optimization (90C31) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the approximability of covering points by lines and related problems
• On a covering problem in the plane
• scientific article; zbMATH DE number 5232536
• On covering of real line by null sets
• On a set of problems on covering of a bounded set
• Optimal covering points and related problems
• scientific article; zbMATH DE number 36205
• On the Covering and the Additivity Number of the Real Line
• On the Geometry of the Solutions of the Cover Problem
• A general covering lemma for the real line

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Improved complexity bounds for location problems on the real line
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Cited in

(7)

• Approximating Distance Measures for the Skyline
• On covering of real line by null sets
• Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
• The p-cover problem
• On the approximability of covering points by lines and related problems
• On the Covering and the Additivity Number of the Real Line
• New algorithms for facility location problems on the real line

This page was built for publication: On the p‐coverage problem on the real line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422012)