642 search results - page 11 / 129 » Approximation Algorithms for Minimum K-Cut |
112
click to vote
IPL
2007
15 years 3 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
149
click to vote
CATS
2006
15 years 4 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
175
click to vote
COMGEO
2002
ACM
15 years 3 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
139
click to vote
JAL
2006
15 years 3 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
134
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...