3874 search results - page 233 / 775 » Approximation Algorithms for k-hurdle Problems |
118
click to vote
UAI
2004
15 years 5 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
147
click to vote
ISPD
2009
ACM
15 years 11 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
146
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
133
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
115
click to vote
DM
2008
15 years 4 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...