Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 100-105

  Blum, Avrim ^a   Konjevod, Goran ^a   Ravi, R ^a   Vempala, Santosh ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; LINEARIZATION; MATHEMATICAL PROGRAMMING;

VERTEX-ORDERING PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0031636099     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276717     Document Type: Conference Paper

References (10)