On positive integral metrics of polynomially bounded diameter, a supplied anchor with distinct accurate proxies for all but logarithmically many comparison clusters and sufficiently small total proxy error supports a polynomial-time k-median recovery algorithm opening at most k facilities and attaining a (1+2/e+ε) factor against those comparison centers with any requested confidence.
On positive integral metrics of polynomially bounded diameter, a supplied anchor with distinct accurate proxies for all but logarithmically many comparison clusters and sufficiently small total proxy error supports a polynomial-time k-median recovery algorithm opening at most k facilities and attaining a (1+2/e+ε) factor against those comparison centers with any requested confidence.
On positive integral metrics of polynomially bounded diameter, a supplied anchor with distinct accurate proxies for all but logarithmically many comparison clusters and sufficiently small total proxy error supports a polynomial-time k-median recovery algorithm opening at most k facilities and attaining a (1+2/e+ε) factor against those comparison centers with any requested confidence.
If correct, gives a polynomial-time recovery step that maintains the exact facility budget under stated anchor-quality conditions.
Can metric k-median recover a near-optimal solution from an almost accurate anchor while opening at most k facilities?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
