145 search results - page 6 / 29 » On finding approximate optimal paths in weighted regions |
CCCG
2010
14 years 11 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
JAT
2010
14 years 4 months ago
2010
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
64
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...