Back to Results
First PageMeta Content
Applied mathematics / Optical devices / Network theory / NP / Shortest path problem / Beam splitter / Theoretical computer science / Computational complexity theory / Complexity classes


CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Minimizing the endpoint trace length of rod motions amidst polygonal obstacles is NP-hard Extended Abstract
Add to Reading List

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

Open Document

File Size: 102,62 KB

Share Result on Facebook

City

JAIST / Halifax / New York / /

Company

Lawrence Erlbaum Associates / /

Country

Japan / Canada / /

Facility

University of British Columbia / Courant Institute / University of Minnesota / New York University / /

IndustryTerm

ε-approximation algorithms / polynomial time algorithms / shortest path search / efficient algorithm / efficient general algorithms / polynomial time algorithm / polynomial time solution / approximation algorithms / /

Organization

New York University / School of Information Science / National Science Foundation / Courant Institute / Institute for Mathematics / University of British Columbia / University of Minnesota / /

Person

J. Canny / J. H. Reif / /

ProvinceOrState

Minnesota / Nova Scotia / British Columbia / New York / /

PublishedMedium

Communications on Pure and Applied Mathematics / Mathematische Zeitschrift / /

Technology

efficient algorithm / nding ε-approximation algorithms / polynomial time algorithm / Papadimitriou-Silverberg algorithm / Pseudo approximation algorithms / polynomial time algorithms / /

SocialTag