The T-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations

    Abstract

    Given a graph G with weighted edges, and a subset of nodes T, the T-join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A iff u ∈ T. We describe the applications of the T-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal refinement of finite element meshes. We suggest a practical algorithm for the Tjoin problem. In sparse graphs, this algorithm is faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithm.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings
    EditorsFrank Dehne, Jorg-Rudiger Sack, Arvind Gupta, Roberto Tamassia
    PublisherSpringer Verlag
    Pages25-36
    Number of pages12
    ISBN (Print)3540662790, 9783540662792
    DOIs
    StatePublished - 1999
    Event6th International Workshop on Algorithms and Data Structures, WADS 1999 - Vancouver, Canada
    Duration: Aug 11 1999Aug 14 1999

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1663
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other6th International Workshop on Algorithms and Data Structures, WADS 1999
    CountryCanada
    CityVancouver
    Period8/11/998/14/99

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'The T-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout'. Together they form a unique fingerprint.

    Cite this