Metric violation distance: hardness and approximation (Q2134750): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Metric Nearness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Embeddings with Relaxed Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance realization problems with applications to internet tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Metric Repair on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric embeddings with outliers / rank
 
Normal rank

Latest revision as of 20:24, 28 July 2024

scientific article
Language Label Description Also known as
English
Metric violation distance: hardness and approximation
scientific article

    Statements

    Identifiers