4894 search results - page 73 / 979 » The Guarding Problem - Complexity and Approximation |
126
click to vote
ORL
2007
15 years 2 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
114
click to vote
ICRA
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
134
click to vote
PARLE
1987
15 years 6 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
156
click to vote
WAOA
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
122
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...