On routing in VLSI design and communication networks

Authors:
Tamás Terlaky;Anthony Vannelli;Hu Zhang
Affiliations:
AdvOL, Department of Computing and Software, McMaster University, Hamilton, Canada;Department of Electrical and Computer Engineering, University of Waterloo, Canada;AdvOL, Department of Computing and Software, McMaster University, Hamilton, Canada
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 13
Cited 1

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The steiner problem with edge lengths 1 and 2,

Information Processing Letters
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Coordination complexity of parallel price-directive decomposition

Mathematics of Operations Research
The multicast packing problem

IEEE/ACM Transactions on Networking (TON)
Provably Good Global Routing of Integrated Circuits

SIAM Journal on Optimization
Towards a Practical Volumetric Cutting Plane Method for Convex Programming

SIAM Journal on Optimization
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
New modeling and optimization techniques for the global routing problem

New modeling and optimization techniques for the global routing problem
Minimum k Arborescences with Bandwidth Constraints

Algorithmica
Integer Linear Programming Models for Global Routing

INFORMS Journal on Computing
Research: A group multicast routing algorithm by using multiple minimum Steiner trees

Computer Communications

Approximating the Generalized Capacitated Tree-Routing Problem

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the global routing problem in VLSI design and the multicast routing problem in communication networks. We first propose new and realistic models for both problems. Both problems are $\mathcal{NP}$-hard. We present the integer programming formulation of both problems and solve the linear programming (LP) relaxations approximately by the fast approximation algorithms for min-max resource-sharing problems in [10]. For the global routing problem, we investigate particular properties of lattice graphs and propose a combinatorial technique to overcome the hardness due to the bend-dependent vertex cost. Finally we develop asymptotic approximation algorithms for both problems depending on the best known approximation ratio for the minimum Steiner tree problem. They are the first known theoretical approximation bound results for these problems.