Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
Home
Publications
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
Authors:
JK
Jochen Könemann
Jochen Könemann
AL
Asaf Levin
Asaf Levin
AS
Amitabh Sinha
Amitabh Sinha
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
15 October 2004
journal article
Published by
Springer Nature
in
Algorithmica
Vol. 41
(2)
,
117-129
DOI:
10.1007/s00453-004-1121-2
Abstract
No abstract available
Keywords
APPROXIMATION ALGORITHMS
SPANNING TREES
BICRITERIA APPROXIMATION
DEGREE-BOUNDED SPANNING TREES
Cited
Cited by 32 articles
Scroll to top