×

Found 186 Documents (Results 1–100)

On superperfection of edge intersection graphs of paths. (English) Zbl 1479.05311

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 79-91 (2021).
PDFBibTeX XMLCite
Full Text: DOI Link

Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. (English) Zbl 1508.68263

Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 21st international conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12125, 104-116 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Sherali-Adams strikes back. (English) Zbl 1528.68318

Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 8, 30 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

How to secure matchings against edge failures. (English) Zbl 1528.68296

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 38, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

From graph orientation to the unweighted maximum cut. (English) Zbl 1476.68192

Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 370-384 (2016).
PDFBibTeX XMLCite
Full Text: DOI HAL

Combinatorial and geometric properties of the max-cut and min-cut problems. (English. Russian original) Zbl 1291.90198

Dokl. Math. 88, No. 2, 516-517 (2013); translation from Dokl. Akad. Nauk. 452, No. 2, 127-129 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Complexity of the positive semidefinite matrix completion problem with a rank constraint. (English) Zbl 1272.68140

Bezdek, Károly (ed.) et al., Discrete geometry and optimization. Selected papers based on the presentations at the conference and workshop, Toronto, Canada, September 19–23, 2011. New York, NY: Springer (ISBN 978-3-319-00199-9/hbk; 978-3-319-00200-2/ebook). Fields Institute Communications 69, 105-120 (2013).
MSC:  68Q17 90C22 05C62
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the facets of the lift-and-project relaxations of graph subdivisions. (English) Zbl 1268.05188

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 201-206 (2011).
MSC:  05C85 90C27
PDFBibTeX XMLCite
Full Text: DOI

A new facet generating procedure for the stable set polytope. (English) Zbl 1268.05216

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 183-188 (2011).
MSC:  05C85 05C69 52B12
PDFBibTeX XMLCite
Full Text: DOI

The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. (English) Zbl 1274.90448

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 1185-1192 (2010).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software