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

Practical Approximation Algorithms for Zero- and Bounded-Skew Trees

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

DOI10.1137/S0895480100378367zbMath0992.68238OpenAlexW2060400450MaRDI QIDQ2784505

Ion I. Măndoiu, Alexander Z. Zelikovsky

Publication date: 23 April 2002

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100378367


zbMATH Keywords

approximation algorithmsSteiner treesclock routingVLSI physical design


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)








This page was built for publication: Practical Approximation Algorithms for Zero- and Bounded-Skew Trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2784505&oldid=15674746"
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 16:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki