Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2928707
Jump to:navigation, search

zbMath1302.90181MaRDI QIDQ2928707

Bernhard Korte, Jens Vygen, Stephan Held, Dieter Rautenbach

Publication date: 10 November 2014


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial optimizationVLSIroutinglayoutphysical designplacementtiming optimizationclock tree synthesis


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)


Related Items (8)

Steiner tree packing revisited ⋮ A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ Local search with a SAT oracle for combinatorial optimization ⋮ On the edge-length ratio of outerplanar graphs ⋮ Steiner trees with bounded RC-delay ⋮ Travelling on graphs with small highway dimension ⋮ Retracting Graphs to Cycles







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2928707&oldid=15905337"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki