Sciweavers

287 search results - page 14 / 58
» Constant Factor Approximations for the Hotlink Assignment Pr...
Sort
View
IPL
2006
84views more  IPL 2006»
14 years 11 months ago
On the hardness of approximating Max-Satisfy
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
Uriel Feige, Daniel Reichman
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
14 years 11 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
ECRTS
2004
IEEE
15 years 3 months ago
Optimized Slowdown in Real-Time Task Systems
In [1], Jejurikar and Gupta investigated energy savings due to optimal slowdown of periodic tasks in real-time task systems, where tasks have varying power characteristics and task...
Ravindra Jejurikar, Rajesh K. Gupta
DISOPT
2010
129views more  DISOPT 2010»
14 years 11 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 6 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...