Back to Results
First PageMeta Content
Spanning tree / Tree / Planar separator theorem / Steiner tree problem / Graph theory / Theoretical computer science / Mathematics


CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Approximating the Geometric Minimum-Diameter Spanning Tree Michael J. Spriggs∗ J. Mark Keil†
Add to Reading List

Document Date: 2004-01-08 18:44:30

Open Document

File Size: 95,48 KB

Share Result on Facebook

City

Saskatoon / Halifax / /

Country

United States / Canada / Israel / /

Currency

pence / /

/

Facility

University of Saskatchewan / University of Waterloo / University of North Carolina / Chapel Hill / University of Texas / Ben Gurion University / University Avenue West / /

/

IndustryTerm

runtime solution / approximation algorithm / heavy machinery / efficent approximating algorithm / /

NaturalFeature

Chapel Hill / /

Organization

well∗ School of Computer Science / Department of Computer Science / Ben Gurion University / University of North Carolina / Univ. of Saskatchewan / University of Waterloo / University of Texas at Dallas / University of Saskatchewan / /

Person

Michael Segal§ Jack Snoeyink / /

/

ProvinceOrState

Texas / Saskatchewan / Nova Scotia / North Carolina / /

PublishedMedium

the VLSI Journal / /

Technology

5 The approximation algorithm / efficent approximating algorithm / approximation algorithm / time algorithm / /

SocialTag