Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 508829

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

zbMATH Open0787.94026MaRDI QIDQ4280133FDOQ4280133


Authors: Alexander Martin, Robert Weismantel Edit this on Wikidata


Publication date: 24 May 1994



Title of this publication is not available (Why is that?)



Recommendations

  • Packing Steiner trees: Polyhedral investigations
  • The Steiner tree packing problem in VLSI design
  • scientific article; zbMATH DE number 108281
  • Two Steiner tree packing problems


zbMATH Keywords

polyhedronpolytopesrouting problemelectronic circuitsSteiner tree packing problem


Mathematics Subject Classification ID



Cited In (5)

  • Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
  • Title not available (Why is that?)
  • Hardness and approximation results for packing Steiner trees
  • On routing in VLSI design and communication networks
  • Packing trees in communication networks





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4280133)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4280133&oldid=18201095"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 18:14. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki