Back to Results
First PageMeta Content
NP-complete problems / Steiner tree problem / Spanning tree / Tree / Graph / Graph coloring / Matroid theory / Quasi-bipartite graph / Minimum spanning tree / Graph theory / Theoretical computer science / Mathematics


CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximating Full Steiner Tree in a Unit Disk Graph Ahmad Biniaz∗ Anil Maheshwari∗
Add to Reading List

Document Date: 2014-06-18 15:41:52


Open Document

File Size: 265,53 KB

Share Result on Facebook

City

Bern / Halifax / P. E / /

Company

Steiner / /

Country

Netherlands / Canada / /

Facility

Carleton University / University of New York / /

IndustryTerm

2σ-approximation algorithm / 20approximation algorithm / approximation algorithm / polynomial time approximation algorithm / polylogarithmic approximation algorithm / improved approximation algorithm / search algorithm / approximation algorithms / /

Organization

School of Computer Science / Carleton University / Ottawa / University of New York at Buffalo / Department of Computer Science and Engineering / gr / /

Person

Lin / Xue / Anil Maheshwari∗ Michiel Smid / /

ProvinceOrState

Nova Scotia / /

Technology

2σ-approximation algorithm / proposed algorithm / search algorithm / approximation algorithm / 1.55-approximation algorithm / approximation algorithms / J. Algorithms / improved approximation algorithm / 3 Algorithm / SNP / polylogarithmic approximation algorithm / 20approximation algorithm / polynomial time approximation algorithm / 20-approximation algorithm / 2 Approximation algorithm / /

URL

http /

SocialTag