The asymmetric orientation control matching problem : analysis and algorithms

Authors
Briggs, Lily A.
ORCID
Loading...
Thumbnail Image
Other Contributors
Krishnamoorthy, M. S.
Anshelevich, Elliot
Goldberg, Mark
Mitchell, John E.
Issue Date
2015-05
Keywords
Computer science
Degree
PhD
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
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
Department
Dept. of Computer Science
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.