642 search results - page 68 / 129 » Approximation Algorithms for Minimum K-Cut |
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
IJFCS
2006
14 years 12 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
108
click to vote
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
SSS
2009
Springer
15 years 6 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
113
click to vote
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...