7129 search results - page 794 / 1426 » Approximation Algorithms for Treewidth |
186
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
183
Voted
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
169
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
186
Voted
ATAL
2009
Springer
16 years 1 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...
183
click to vote
COCO
2009
Springer
16 years 1 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−(...