642 search results - page 82 / 129 » Approximation Algorithms for Minimum K-Cut |
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
108
click to vote
SODA
2003
ACM
15 years 1 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
111
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
111
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
115
click to vote
ESA
2005
Springer
15 years 5 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...