Extracting schema from semistructured data
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An algorithm for finding a K-median in a directed tree
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
On the facets of the simple plant location packing polytope
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Polyhedral Properties of the K-median Problem on a Tree
Mathematical Programming: Series A and B
On the Integrality of Some Facility Location Polytopes
SIAM Journal on Discrete Mathematics
The p-median polytope of Y-free graphs: An application of the matching theory
Operations Research Letters
On the p-median polytope of Y-free graphs
Discrete Optimization
A family of facets for the uncapacitated p-median polytope
Operations Research Letters
| Hi-index | 0.00 |
We study a well-known linear programming relaxation of the p-median problem. We give a characterization of the directed graphs for which this system of inequalities defines an integral polytope. As a consequence, we obtain that the p-median problem is polynomial in that class of graphs. We also give an algorithm to recognize these graphs.