Geometric quadrisection in linear time, with application to VLSI placement
type: Item
instance of: scholarly article
title: Geometric quadrisection in linear time, with application to VLSI placement
zbMATH Open document ID: 1172.68008
author: Jens Vygen
published in: Discrete Optimization
publication date: 2009-06-02T00:00:00Z
Mathematics Subject Classification ID: 68M99
Mathematics Subject Classification ID: 90C99
zbMATH DE Number: 5560504
zbMATH Keywords: VLSI placement
zbMATH Keywords: Generalized Assignment Problem
zbMATH Keywords: Multiple Knapsack Problem
zbMATH Keywords: Quadrisection
zbMATH Keywords: Weighted median
MaRDI profile type: Publication
full work available at URL: j.disopt.2005.08.007
OpenAlex ID: W1975942652
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Recent directions in netlist partitioning: a survey
cites work: Time bounds for selection
cites work: Optimality of Nested Partitions and Its Application to Cluster Analysis
cites work: Q4952619
cites work: Discrete-Variable Extremum Problems
cites work: Divide-and-conquer approximation algorithms via spreading metrics
cites work: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
cites work: Q4142699
cites work: Combinatorial optimization. Theory and algorithms
cites work: Q3997942
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: An approximation algorithm for the generalized assignment problem
cites work: Efficient Algorithms for the Hitchcock Transportation Problem
cites work: On dual minimum cost flow algorithms
DOI: 10.1016/J.DISOPT.2005.08.007
description: scientific article; zbMATH DE number 5560504