Back to Results
First PageMeta Content
NP-complete problems / Combinatorial optimization / Graph connectivity / Matching / Steiner tree problem / Minimum spanning tree / Eulerian path / Route inspection problem / Cut / Graph theory / Theoretical computer science / Mathematics


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart†
Add to Reading List

Document Date: 2008-10-29 00:07:19

Open Document

File Size: 133,10 KB

Share Result on Facebook

Company

SIAM Journal / /

/

Facility

Stony Brook University / /

IndustryTerm

polynomial algorithm / polynomial-time algorithm / Approximation algorithms / /

Organization

OP TT / National Aeronautics and Space Administration / Department of Applied Mathematics and Statistics / National Science Foundation / Department of Computer Science / Stony Brook University / /

Person

T. Biedl / Bonnie Skiena / /

Position

artist / salesman / /

PublishedMedium

SIAM Journal on Computing / Theoretical Computer Science / /

Technology

Approximation algorithms / polynomial-time 2-approximation algorithm / 3/2approximation algorithm / polynomial-time algorithm / polynomial algorithm / /

SocialTag