On the p‐coverage problem on the real line

DOI10.1111/j.1467-9574.2007.00347.xzbMath1122.90104OpenAlexW1564192967MaRDI QIDQ5422012

Albert P. M. Wagelmans, Stan P. M. van Hoesel

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

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

Related Items (2)

New algorithms for facility location problems on the real line ⋮ Approximating Distance Measures for the Skyline

Cites Work

• Unnamed Item
• Improved complexity bounds for location problems on the real line
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

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