Computational geometry: an introduction
Computational geometry: an introduction
SIAM Journal on Algebraic and Discrete Methods
An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Integer and combinatorial optimization
Integer and combinatorial optimization
The concave least-weight subsequence problem revisited
Journal of Algorithms
A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming
A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming
The distance-domination numbers of trees
Operations Research Letters
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Minimum Lk path partitioning-An illustration of the Monge property
Operations Research Letters
Structured p-facility location problems on the line solvable in polynomial time
Operations Research Letters
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Optimal algorithms for the weighted p-center problems on the real line for small p
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In this note we apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line.