Back to Results
First PageMeta Content
NP-complete problems / Spanning tree / Network theory / Minimum spanning tree / Shortest path problem / Tree / Graph / Approximation algorithm / Steiner tree problem / Theoretical computer science / Graph theory / Mathematics


A 2.5 Factor Approximation Algorithm for the k-MST Problem Sunil Arya∗ H. Ramesh†
Add to Reading List

Document Date: 2006-04-04 10:31:23

Open Document

File Size: 58,99 KB

Share Result on Facebook

City

Kowloon / /

Company

SIAM Journal / /

/

Facility

Indian Institute of Science / Hong Kong University of Science / /

IndustryTerm

factor approximation algorithm / above algorithms / constant factor approximation algorithm / above algorithm / approximation algorithm / binary search / be approximated using binary search / /

NaturalFeature

Clear Water Bay / /

OperatingSystem

L3 / /

Organization

Hong Kong University of Science and Technology / Indian Institute of Science / Bangalore / /

Person

Sunil Arya / /

Position

author / /

PublishedMedium

SIAM Journal on Computing / the Theory of Computing / /

Technology

above algorithms / 3-factor approximation algorithm / Approximation algorithms / constant factor approximation algorithm / approximation algorithm / 2.5 Factor Approximation Algorithm / 2-factor approximation algorithm / 3 factor approximation algorithm / /

SocialTag