4843 search results - page 172 / 969 » The Shortcut Problem - Complexity and Approximation |
133
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
109
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
139
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
125
click to vote
ICCAD
2008
IEEE
16 years 5 days 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...
113
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...