Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC, 1995.

STOC 1995
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1995-AwerbuchABV,
	author        = "Baruch Awerbuch and Yossi Azar and Avrim Blum and Santosh Vempala",
	booktitle     = "{Proceedings of the 27th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/225058.225139",
	isbn          = "0-89791-718-9",
	pages         = "277--283",
	publisher     = "{ACM}",
	title         = "{Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen}",
	year          = 1995,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.