Back to Results
First PageMeta Content
Matching / Differential geometry / Hungarian algorithm / Assignment problem / Differential geometry of curves / Dynamic programming / Continuous-repayment mortgage / Mathematics / Mathematical analysis / Combinatorial optimization


An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem Justin Colannino Mirela Damian∗
Add to Reading List

Document Date: 2007-12-27 15:24:30

Open Document

File Size: 174,85 KB

Share Result on Facebook

/

Facility

Villanova University / /

/

IndustryTerm

shortest path algorithms / /

Organization

Queen’s Univ. / Villanova Univ. / Rutgers / Henk Meijer Suneeta Ramaswami School of Computing / Restriction Scaffold Assignment Problem Justin Colannino Mirela Damian∗ School of Comp / School of Comp / Catalunya Polytechnic Univ. / McGill Univ. / Villanova University / /

Person

Ferran Hurtado John Iacono / /

/

Position

Corresponding author / /

ProvinceOrState

Pennsylvania / Arkansas / /

Technology

shortest path algorithms / Minimum Cost Assignment Our algorithm / time algorithm / /

SocialTag