Design and implementation of move-based heuristics for VLSI hypergraph partitioning

DOI10.1145/351827.384247zbMath1071.68532OpenAlexW1982992099MaRDI QIDQ5463400

Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/351827.384247

zbMATH Keywords

AlgorithmsPerformanceMeasurementExperimentationVLSI CADBalanced min-cut hypergraph partitioning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Related Items (2)

New challenges in dynamic load balancing ⋮ Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem

This page was built for publication: Design and implementation of move-based heuristics for VLSI hypergraph partitioning