Back to Results
First PageMeta Content
NP-complete problems / Spanning tree / Steiner tree problem / Minimum spanning tree / Time complexity / Approximation algorithm / Rectilinear Steiner tree / Theoretical computer science / Graph theory / Computational complexity theory


CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract
Add to Reading List

Document Date: 2008-10-28 21:29:08

Open Document

File Size: 80,93 KB

Share Result on Facebook

City

Ottawa / Buffalo / /

Country

United States / /

/

Facility

State University of New York / Terminal Steiner Tree / /

IndustryTerm

wireless sensor network / heuristic algorithm / constant approximation algorithm / polynomial time approximation algorithm / exhausive search / wireless network design / polynomial time algorithm / image processing / wireless network area / approximation algorithms / /

Organization

OP TT / Department of Computer Science and Engineering / State University of New York / Buffalo / Association for Computing Machinery / /

ProvinceOrState

New York / Ontario / /

PublishedMedium

Theoretical Computer Science / /

Technology

2 Algorithm / approximation algorithms / following algorithm / constant approximation algorithm / polynomial time algorithm / image processing / polynomial time approximation algorithm / 2.1 Our algorithm Our algorithm / MST heuristic algorithm / /

SocialTag