3875 search results - page 195 / 775 » Approximation algorithms for the 0-extension problem |
166
click to vote
DCOSS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
131
click to vote
IPCO
1996
15 years 6 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
122
Voted
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
145
click to vote
HEURISTICS
2006
15 years 5 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
197
click to vote
PEPM
1995
ACM
15 years 8 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...