A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs

DOI10.1007/BF01719261zbMath0842.90117MaRDI QIDQ1909003

E. A. de Kock, Emile H. L. Aarts, G. Essink, R. E. J. Jansen, Jan H. M. Korst

Publication date: 7 March 1996

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

partitioningschedulinglocal searchdelay managementmapping problemreal time-video signal processingrecursive bipartitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem

Cites Work

• How easy is local search?
• Simple Local Search Problems that are Hard to Solve
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs