Geometric quadrisection in linear time, with application to VLSI placement

DOI10.1016/j.disopt.2005.08.007zbMath1172.68008OpenAlexW1975942652MaRDI QIDQ1019299

Jens Vygen

Publication date: 2 June 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.08.007

zbMATH Keywords

VLSI placementGeneralized Assignment ProblemMultiple Knapsack ProblemQuadrisectionWeighted median

Mathematics Subject Classification ID

Computer system organization (68M99) Mathematical programming (90C99)

Related Items (1)

A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• An approximation algorithm for the generalized assignment problem
• Time bounds for selection
• On dual minimum cost flow algorithms
• Divide-and-conquer approximation algorithms via spreading metrics
• Recent directions in netlist partitioning: a survey
• Improved Algorithms for Bipartite Network Flow
• Optimality of Nested Partitions and Its Application to Cluster Analysis
• Efficient Algorithms for the Hitchcock Transportation Problem
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Discrete-Variable Extremum Problems
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Combinatorial optimization. Theory and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Geometric quadrisection in linear time, with application to VLSI placement