Back to Results
First PageMeta Content
Spanning tree / NP-complete problems / Steiner tree problem / NP-hard problems / Quasi-bipartite graph / Minimum spanning tree / Rectilinear Steiner tree / Vertex cover / Matching / Graph theory / Theoretical computer science / Mathematics


Improved Steiner Tree Approximation in Graphs Gabriel Robinsy and Alexander Zelikovskyz y
Add to Reading List

Document Date: 1999-10-25 15:38:00


Open Document

File Size: 253,63 KB

Share Result on Facebook

City

Monterey / P. Plassmann / Amsterdam / Bern / Plassmann / /

Company

Vertex / /

Country

Netherlands / /

/

Facility

University of Virginia / Georgia State University / /

IndustryTerm

found solution / achievable solution / primaldual algorithm / approximation algorithm / approximate solution / dual -based algorithm / overall solution / /

Organization

University of Virginia / UCLA / Los Angeles / Georgia State University / Atlanta / National Science Foundation / Department of Computer Science / /

Person

Ti / I. I. Mandoiu / V / Gi / Alexander Zelikovskyz / /

/

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

TSP / /

ProvinceOrState

Virginia / California / /

PublishedMedium

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems / /

Technology

main algorithm / RNC-Approximation Algorithms / 11 6-Approximation Algorithm / 4 Algorithm / approximation algorithm / 1.598 Approximation Algorithm / Berman-Ramayer algorithm / k-restricted Loss-Contracting Algorithm / primaldual algorithm / Approximation Algorithms / SNP / k-LCA algorithm / dual -based algorithm / Integrated Circuits / 1.2875approximation algorithm / /

URL

www.cs.gsu.edu / www.cs.virginia.edu / /

SocialTag