A constant factor approximation algorithm for a class of classification problems
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 652-658
- https://doi.org/10.1145/335305.335397
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Rounding algorithms for a geometric embedding of minimum multiway cutPublished by Association for Computing Machinery (ACM) ,1999
- Fast approximate energy minimization via graph cutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Minimum 0-Extensions of Graph MetricsEuropean Journal of Combinatorics, 1998
- An improved approximation algorithm for multiway cutPublished by Association for Computing Machinery (ACM) ,1998
- On approximating arbitrary metrices by tree metricsPublished by Association for Computing Machinery (ACM) ,1998
- Geometry of Cuts and MetricsPublished by Springer Nature ,1997
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- Evolutionary trees: An integer multicommodity max-flow-min-cut theoremAdvances in Applied Mathematics, 1992
- On the Statistical Analysis of Dirty PicturesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1986
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984