2137 search results - page 118 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
149
click to vote
SIAMDM
2000
15 years 4 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
167
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
118
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
156
click to vote
WG
2007
Springer
15 years 11 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
176
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...