Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
Markov random fields for image modelling and analysis
Modelling and applications of stochastic processes
Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
An LC branch-and-branch algorithm for the module assignment problem
Information Processing Letters
Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
An improved algorithm for the planar 3-cut problem
Journal of Algorithms
Finding k-cuts within twice the optimal
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Optimal Task Assignment in Linear Array Networks
IEEE Transactions on Computers
An efficient algorithm for a task allocation problem
Journal of the ACM (JACM)
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds for the max-flow min-multicut ratio for planar and Kr,r-free graphs
Information Processing Letters
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
On weighted multiway cuts in trees
Mathematical Programming: Series A and B
Markov random field modeling in computer vision
Markov random field modeling in computer vision
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Inducing Features of Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the task assignment problem: two new efficient heuristic algorithms
Journal of Parallel and Distributed Computing
Enhanced hypertext categorization using hyperlinks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Minimum 0-extensions of graph metrics
European Journal of Combinatorics
Rounding algorithms for a geometric embedding of minimum multiway cut
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
An improved approximation algorithm for MULTIWAY CUT
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Information Processing Letters
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
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal 3-Terminal Cuts and Linear Programming
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Task Assignment in Distributed Systems Using Network Flow Methods
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
A New Algorithm for Energy Minimization with Discontinuities
EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
A 2-approximation algorithm for the directed multiway cut problem
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient graph-based energy minimization methods in computer vision
Efficient graph-based energy minimization methods in computer vision
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The Hardness of Metric Labeling
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Polynomial algorithm for the k-cut problem
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Approximation through multicommodity flow
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The task allocation problem with constant communication
Discrete Applied Mathematics
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
Operations Research Letters
| Hi-index | 0.00 |
We consider a general classification problem, also known as labeling problem, which is strongly related to several standard classification frameworks and has applications in various computer science domains. In this chapter, we put together and review known results coming from application domains as well as recent advances on the approximability of the problem.