Preprocessing Steiner problems from VLSI layout (Q4785218): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.10035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039706936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem reduction methods and a tree generation algorithm for the steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions for the rectilinear steiner tree problem / rank
 
Normal rank

Latest revision as of 10:51, 5 June 2024

scientific article; zbMATH DE number 1847185
Language Label Description Also known as
English
Preprocessing Steiner problems from VLSI layout
scientific article; zbMATH DE number 1847185

    Statements

    Preprocessing Steiner problems from VLSI layout (English)
    0 references
    0 references
    0 references
    17 December 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial preprocessing
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references