554 search results - page 63 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
163
Voted
COR
2008
15 years 6 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
167
click to vote
FOCS
2006
IEEE
16 years 4 days ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
178
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
129
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
162
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...