✦ LIBER ✦

Graph partitioning using linear and semidefinite programming

✍ Scribed by A. Lisser; F. Rendl

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 92 KB
Volume: 95
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-002-0342-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved rounding method and semidefi

An improved rounding method and semidefinite programming relaxation for graph partition

✍ Qiaoming Han; Yinyu Ye; Jiawei Zhang 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 192 KB

Sensitivity analysis in linear programmi

Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

✍ E. Alper Yıldırım; Michael Todd 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 277 KB

Linear and quadratic programming approac

Linear and quadratic programming approaches for the general graph partitioning problem

✍ Neng Fan; Panos M. Pardalos 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 269 KB

Semidefinite programming relaxations for

Semidefinite programming relaxations for graph coloring and maximal clique problems

✍ Igor Dukanovic; Franz Rendl 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 245 KB

Positive semidefinite matrix completions

Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming

✍ Houduo Qi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Let G = (V , E) be a graph. In matrix completion theory, it is known that the following two conditions are equivalent: (i) G is a chordal graph; (ii) Every G-partial positive semidefinite matrix has a positive semidefinite matrix completion. In this paper, we relate these two conditions to constrain

A load dispatch method using fractional

A load dispatch method using fractional programming and semidefinite programming

✍ Yasuhiro Kobayashi; Toshiyuki Sawa; Toshiyuki Furukawa; Shigeru Kawamoto 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB