The maximum k-colorable subgraph problem and related problems
Year of publication: |
2022
|
---|---|
Authors: | Kuryatnikova, Olga ; Sotirov, Renata ; Vera, Juan C. |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 1, p. 656-669
|
Subject: | semidefinite programming | chromatic number of a graph | generalized theta number | Hamming graphs | Johnson graphs | k-colorable subgraph problem | stable set | Mathematik | Mathematics | Graphentheorie | Graph theory |
-
On bounding the bandwidth of graphs with symmetry
Dam, Edwin Robert van, (2015)
-
An SDP-based approach for computing the stability number of a graph
Gaar, Elisabeth, (2022)
-
An efficient semidefinite programming relaxation for the graph partition problem
Sotirov, Renata, (2014)
- More ...
-
The many faces of positivity to approximate structured optimization problems
Kuryatnikova, Olga, (2019)
-
Static-Arbitrage Bounds on the Prices of Basket Options via Linear Programming
Peña, Javier F., (2006)
-
Exploiting equalities in polynomial programming
Peña, Javier F., (2008)
- More ...