796 search results - page 88 / 160 » Approximating the centroid is hard |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...