The asymmetric orientation control matching problem : analysis and algorithms
Loading...
Authors
Briggs, Lily A.
Issue Date
2015-05
Type
Electronic thesis
Thesis
Thesis
Language
ENG
Keywords
Computer science
Alternative Title
Abstract
We prove that AOCM is NP-complete, and further, that it is APX-hard. We show that the uniform-weight case, however, is reducible to finding simple 2-matchings in undirected graphs, and is thus polynomially solvable.
Description
May 2015
School of Science
School of Science
Full Citation
Publisher
Rensselaer Polytechnic Institute, Troy, NY