1461 search results - page 8 / 293 » Complexity of Graph Covering Problems |
ALGORITHMICA
2010
14 years 9 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
109
click to vote
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
108
click to vote
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
94
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
130
click to vote
DAM
2011
14 years 4 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...