Minimum 0-extensions of graph metrics

A constant factor approximation algorithm for a class of classification problems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Approximation algorithms for the 0-extension problem

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithms for the metric labeling problem via a new linear programming formulation

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields

Journal of the ACM (JACM)

An improved approximation algorithm for the 0-extension problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Approximate classification via earthmover metrics

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Hard cases of the multifacility location problem

Discrete Applied Mathematics

On earthmover distance, metric labeling, and 0-extension

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Approximation algorithms for labeling hierarchical taxonomies

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Efficiently solving convex relaxations for MAP estimation

Proceedings of the 25th international conference on Machine learning

Packing multiway cuts in capacitated graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Tight spans of distances and the dual fractionality of undirected multiflow problems

Journal of Combinatorial Theory Series B

How to complete a doubling metric

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Extensions and limits to vertex sparsification

Proceedings of the forty-second ACM symposium on Theory of computing

The maximum multiflow problems with bounded fractionality

Proceedings of the forty-second ACM symposium on Theory of computing

Approximating a class of classification problems

Efficient Approximation and Online Algorithms

Bounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems

Journal of Combinatorial Theory Series B

On duality and fractionality of multicommodity flows in directed networks

Discrete Optimization

One more well-solved case of the multifacility location problem

Discrete Optimization

Simplex partitioning via exponential clocks and the multiway cut problem

Proceedings of the forty-fifth annual ACM symposium on Theory of computing