Back to Results
First PageMeta Content
NP-complete problems / Steiner tree problem / Minimum spanning tree / Eulerian path / Matching / Graph coloring / Tree / Connectivity / Matroid theory / Graph theory / Mathematics / Theoretical computer science


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

Document Date: 2008-10-29 00:01:57

Open Document

File Size: 168,78 KB

Share Result on Facebook

Company

SIAM Journal / /

/

Facility

Stony Brook University / /

IndustryTerm

polynomial algorithm / polynomial-time algorithm / possible solution / Approximation algorithms / constantfactor approximation algorithm / /

Organization

OP TT / Department of Applied Mathematics and Statistics / Department of Computer Science / Stony Brook University / /

Person

T. Biedl / /

Position

artist / /

PublishedMedium

SIAM Journal on Computing / /

Technology

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

SocialTag