4843 search results - page 386 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
180
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
149
Voted
CGF
2006
15 years 4 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
104
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper examines two scene recovery problems arising when interpreting data from massive numbers of randomly distributed single pixel cameras. Assuming that the camera position...
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...