Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

M. Laurent, N. Gvozdenovic

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

Original language	English
Title of host publication	Integer programming and combinatorial optimization: 11th international IPCO conference, Berlin, Germany, June 8-10, 2005: Proceedings
Editors	M. Jünger, V. Kaibel
Place of Publication	Berlin
Publisher	Springer
Pages	136-151
Number of pages	16
ISBN (Print)	9783540261995
Publication status	Published - 2005
Externally published	Yes

Name	Lecture notes in computer science
Number	3509

Cite this

Laurent, M., & Gvozdenovic, N. (2005). Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. In M. Jünger, & V. Kaibel (Eds.), Integer programming and combinatorial optimization: 11th international IPCO conference, Berlin, Germany, June 8-10, 2005: Proceedings (pp. 136-151). (Lecture notes in computer science; No. 3509). Springer.

Laurent, M. ; Gvozdenovic, N. / Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Integer programming and combinatorial optimization: 11th international IPCO conference, Berlin, Germany, June 8-10, 2005: Proceedings. editor / M. Jünger ; V. Kaibel. Berlin : Springer, 2005. pp. 136-151 (Lecture notes in computer science; 3509).

@inproceedings{f8c0ff6240c1491fbcf2912a9c3d263d,

title = "Semidefinite bounds for the stability number of a graph via sums of squares of polynomials",

author = "M. Laurent and N. Gvozdenovic",

note = "Pagination: 16",

year = "2005",

language = "English",

isbn = "9783540261995",

series = "Lecture notes in computer science",

publisher = "Springer",

number = "3509",

pages = "136--151",

editor = "M. J{\"u}nger and V. Kaibel",

booktitle = "Integer programming and combinatorial optimization: 11th international IPCO conference, Berlin, Germany, June 8-10, 2005: Proceedings",

address = "Germany",

}

Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. / Laurent, M.; Gvozdenovic, N.
Integer programming and combinatorial optimization: 11th international IPCO conference, Berlin, Germany, June 8-10, 2005: Proceedings. ed. / M. Jünger; V. Kaibel. Berlin: Springer, 2005. p. 136-151 (Lecture notes in computer science; No. 3509).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

TY - GEN

T1 - Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

AU - Laurent, M.

AU - Gvozdenovic, N.

N1 - Pagination: 16

PY - 2005

Y1 - 2005

M3 - Conference contribution

SN - 9783540261995

T3 - Lecture notes in computer science

SP - 136

EP - 151

BT - Integer programming and combinatorial optimization: 11th international IPCO conference, Berlin, Germany, June 8-10, 2005: Proceedings

A2 - Jünger, M.

A2 - Kaibel, V.

PB - Springer

CY - Berlin

ER -