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; zbMATH DE number 1263241

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

zbMath0978.68558MaRDI QIDQ4234114

Ding-Zhu Du, Al Borchers

Publication date: 3 February 2002


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


Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (6)

RNC-approximation algorithms for the steiner problem ⋮ Strong Steiner Tree Approximations in Practice ⋮ Recent results on approximating the Steiner tree problem and its generalizations ⋮ On approximate preprocessing for domination and hitting subgraphs with connected deletion sets ⋮ On the approximability of the Steiner tree problem in phylogeny ⋮ Lossy Kernels for Hitting Subgraphs




This page was built for publication:

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