642 search results - page 20 / 129 » Approximation Algorithms for Minimum K-Cut |
137
click to vote
DAM
1999
15 years 3 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
124
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
128
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
329
Voted
COCOON
2011
Springer
14 years 3 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
158
click to vote
OL
2010
14 years 10 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...