2714 search results - page 33 / 543 » Approximation Schemes for Scheduling |
98
Voted
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
119
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
139
Voted
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
110
Voted
STOC
2003
ACM
16 years 21 days ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
111
click to vote
IJCAI
1997
15 years 1 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...