Graph metric repair, the generalization of repairing a corrupted metric to arbitrary weighted graphs, is APX-hard, has no constant-factor approximation under the Unique Games Conjecture, is FPT on ς-chordal graphs, and admits L- and O(κ log n)-approximations.
Simovici, and Catalin Zara
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Generalized Metric Repair on Graphs
Graph metric repair, the generalization of repairing a corrupted metric to arbitrary weighted graphs, is APX-hard, has no constant-factor approximation under the Unique Games Conjecture, is FPT on ς-chordal graphs, and admits L- and O(κ log n)-approximations.