Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014.

DOI10.4171/OWR/2014/51zbMath1349.00118OpenAlexW4241216116MaRDI QIDQ347232

No author found.

Publication date: 30 November 2016

Published in: Oberwolfach Reports (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/owr/2014/51

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Proceedings of conferences of miscellaneous specific interest (00B25) Combinatorial optimization (90C27) Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Cites Work

• Unnamed Item
• Approximating the independence number via the \(\vartheta\)-function
• On the Lovász Theta function for Independent Sets in Sparse Graphs
• Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
• Independence numbers of locally sparse graphs and a Ramsey type problem
• On the independence number of sparse graphs
• Approximation resistance from pairwise independent subgroups

This page was built for publication: Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014.