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

Author： Blum A. Konjevod G. Ravi R. Vempala S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.235, Iss.1, 2000-03, pp. : 25-42

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Solving polynomial least squares problems via semidefinite programming relaxations

By Kim Sunyoung Kojima Masakazu

Journal of Global Optimization, Vol. 46, Iss. 1, 2010-01 ,pp. : 1-23

Springer Publishing Company

Access to resources Recommend Favorite

SDPARA: SemiDefinite Programming Algorithm paRAllel version

By Yamashita M. Fujisawa K. Kojima M.

Parallel Computing, Vol. 29, Iss. 8, 2003-08 ,pp. : 1053-1067

Elsevier

Access to resources Recommend Favorite

Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem

By Jaulin Luc Henrion Didier

Reliable Computing, Vol. 11, Iss. 1, 2005-02 ,pp. : 1-17

Springer Publishing Company

Access to resources Recommend Favorite

Approximating minimum feedback vertex sets in hypergraphs

By Fujito T.

Theoretical Computer Science, Vol. 246, Iss. 1, 2000-09 ,pp. : 107-116

Elsevier

Access to resources Recommend Favorite

Minimum k Arborescences with Bandwidth Constraints

By Cai Mao-cheng Deng Xiaotie Wang Lusheng

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 529-537

Springer Publishing Company

Access to resources Recommend Favorite