On routing in VLSI design and communication networks
DOI10.1016/j.dam.2008.01.014zbMath1152.68009OpenAlexW2111106757MaRDI QIDQ944702
Hu Zhang, Tamás Terlaky, Anthony Vannelli
Publication date: 10 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.014
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Mathematical problems of computer architecture (68M07) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- Packing trees in communication networks
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- The ellipsoid method and its consequences in combinatorial optimization
- The Steiner tree packing problem in VLSI design
- Minimum \(k\) arborescences with bandwidth constraints
- Packing Steiner trees: A cutting plane algorithm and computational results
- On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
- Provably Good Global Routing of Integrated Circuits
- Integer Linear Programming Models for Global Routing
- Randomized metarounding (extended abstract)
- Packing Steiner Forests
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- Two Steiner tree packing problems
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Packing Steiner Trees: Separation Algorithms
- Coordination Complexity of Parallel Price-Directive Decomposition
- Algorithms – ESA 2004
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Experimental and Efficient Algorithms
- A branch-and-price algorithm for the Steiner tree packing problem.
- Heuristic algorithms for packing of multiple-group multicasting
This page was built for publication: On routing in VLSI design and communication networks
