2698 search results - page 61 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
JCIT
2010
13 years 2 months ago
2010
The aim of this paper is to investigate the multiple attribute decision making problems with linguistic information, in which the information about attribute weights is incomplete...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
TALG
2010
13 years 6 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...