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 2073988

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

zbMATH Open1100.68595MaRDI QIDQ4469003FDOQ4469003


Authors: L. Gao, Deyun Zhang, Zhiping An, Xiaodong Wang Edit this on Wikidata


Publication date: 14 June 2004



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



Recommendations

  • scientific article; zbMATH DE number 1445376
  • Improved Approximations for the Steiner Tree Problem
  • A note on A faster approximation algorithm for the Steiner problem in graphs
  • scientific article; zbMATH DE number 139910
  • A faster approximation algorithm for the Steiner problem in graphs


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)



Cited In (2)

  • Analysis of Steiner subtrees of random trees for traceroute algorithms
  • Improved Steiner tree algorithms for bounded treewidth





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 Q4469003)

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