Maximum Gradient Embeddings and Monotone Clustering

DOI10.1007/978-3-540-74208-1_18MaRDI QIDQ3603469zbMATH OpenOpenAlexFDO

Authors Manor Mendel, Assaf Naor

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_18

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Maximum gradient embeddings and monotone clustering
• Multiembedding of Metric Spaces
• A tight bound on approximating arbitrary metrics by tree metrics
• A tight bound on approximating arbitrary metrics by tree metrics
• scientific article; zbMATH DE number 2079366

Cited in

(2)

• Approximating \(k\)-generalized connectivity via collapsing HSTs
• Maximum gradient embeddings and monotone clustering

This page was built for publication: Maximum Gradient Embeddings and Monotone Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603469)