1566 search results - page 17 / 314 » On a Cone Covering Problem |
WDAG
2009
Springer
14 years 5 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
ESA
2004
Springer
14 years 4 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
DAM
2006
13 years 11 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
JAIR
2007
13 years 10 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
TCS
2010
13 years 9 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...