English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A 3-approximation for the Minimum Tree Spanning with k-vertices

MPS-Authors
/persons/resource/persons44477

Garg,  Naveen
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Garg, N. (1996). A 3-approximation for the Minimum Tree Spanning with k-vertices. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (pp. 302-309). Piscataway, NJ: IEEE explore.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB29-2
Abstract
There is no abstract available