Maximum Gradient Embeddings and Monotone Clustering

DOI10.1007/978-3-540-74208-1_18zbMath1171.90510OpenAlexW2799693456MaRDI QIDQ3603469

Assaf Naor, Manor Mendel

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)

Related Items (1)

Approximating \(k\)-generalized connectivity via collapsing HSTs

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