58 search results - page 6 / 12 » Subexponential Algorithms for Partial Cover Problems |
174
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
112
click to vote
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
109
Voted
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
127
click to vote
JGAA
2000
15 years 2 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
131
click to vote
TCS
2010
15 years 21 days ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...