Theory of linear and integer programming
Theory of linear and integer programming
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Cardinality constrained minimum cut problems: complexity and algorithms
Discrete Applied Mathematics
Multicriteria Global Minimum Cuts
Algorithmica
| Hi-index | 0.00 |
In this paper, we consider multicriteria and cardinality constrained multicut problems. Let G be a graph where each edge is weighted by R positive costs corresponding to R criteria and consider k source-sink pairs of vertices of G and R integers B"1,...,B"R. The problem R-CriMultiCut consists in finding a set of edges whose removal leaves no path between the ith source and the ith sink for each i, and whose cost, with respect to the jth criterion, is at most B"j, for 1=