ISSN:
1436-5057
Keywords:
Key words.Semidefinite programming, association scheme, maximum cut problem.
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract. We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s006070050038