4843 search results - page 72 / 969 » The Shortcut Problem - Complexity and Approximation |
IPL
2007
14 years 9 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
106
click to vote
IJCAI
2001
14 years 11 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...
MOR
2000
14 years 9 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
CCCG
2010
14 years 11 months ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.