3875 search results - page 78 / 775 » Approximation Algorithms for the Max-coloring Problem |
ICALP
2007
Springer
14 years 22 days ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
ISLPED
2007
ACM
13 years 10 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—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...
APPROX
2000
Springer
14 years 1 months ago
2000
Springer
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...