DocumentCode
3435539
Title
Solving graph optimization problems with ZBDDs
Author
Coudert, Olivier
Author_Institution
Synopsys Inc., Mountain View, CA, USA
fYear
1997
fDate
17-20 Mar 1997
Firstpage
224
Lastpage
228
Abstract
This paper presents a ZBDD (Zero-Suppressed Binary Decision Diagram) based framework that solves a collection of graph optimization problems. We show how these problems reduce to three primitive problems, and how the later can be solved exactly using ZBDDs. The application of this framework is illustrated on multilayer planar routing, where it can solve real-life instances that cannot be handled otherwise
Keywords
decision theory; diagrams; directed graphs; network routing; optimisation; ZBDD; graph optimization; multilayer planar routing; zero-suppressed binary decision diagram; Binary decision diagrams; Encoding; Logic; Microwave integrated circuits; Minimization; Polynomials; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
European Design and Test Conference, 1997. ED&TC 97. Proceedings
Conference_Location
Paris
ISSN
1066-1409
Print_ISBN
0-8186-7786-4
Type
conf
DOI
10.1109/EDTC.1997.582363
Filename
582363
Link To Document