316 search results - page 58 / 64 » The chromatic covering number of a graph |
160
click to vote
COLT
2007
Springer
16 years 8 days ago
2007
Springer
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
155
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
171
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
176
click to vote
SAT
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
224
click to vote
ANTSW
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...