7150 search results - page 233 / 1430 » An Approximation Algorithm for Approximation Rank |
168
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
187
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
193
click to vote
ISPD
2009
ACM
16 years 1 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...
181
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...