×

Combinatorial optimization. Abstracts from the workshop held November 9–15, 2014. (English) Zbl 1349.00118

Summary: Combinatorial Optimization is an area of mathematics that thrives from a continual influx of new questions and problems from practice. Attacking these problems has required the development and combination of ideas and techniques from different mathematical areas including graph theory, matroids and combinatorics, convex and nonlinear optimization, discrete and convex geometry, algebraic and topological methods. We continued a tradition of triannual Oberwolfach workshops, bringing together the best international researchers with younger talent to discover new connections with a particular emphasis on emerging breakthrough areas.

MSC:

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

References:

[1] Noga Alon and Nabil Kahale. Approximating the independence number via the -function. Math. Programming, 80(3, Ser. A):253–264, 1998. · Zbl 0895.90169
[2] Per Austrin, Subhash Khot, and Muli Safra. Inapproximability of vertex cover and independent set in bounded degree graphs. Theory of Computing, 7(1):27–43, 2011. · Zbl 1243.68183
[3] Noga Alon. Independence numbers of locally sparse graphs and a Ramsey type problem. Random Struct. Algorithms, 9(3):271–278, 1996. · Zbl 0876.05049
[4] Nikhil Bansal. Approximating independent sets in sparse graphs. In SODA, 2015. · Zbl 1321.05176
[5] Siu On Chan. Approximation resistance from pairwise independent subgroups. In STOC, pages 447–456, 2013. · Zbl 1293.68163
[6] Eran Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput., 31(5):1608–1623, 2002. · Zbl 1041.68130
[7] Johan Hastad. Clique is hard to approximate within n1. In FOCS, pages 627–636, 1996.
[8] Anders Johansson. The choice number of sparse graphs. preprint, August 1996.
[9] James B. Shearer. On the independence number of sparse graphs. Random Struct. Algorithms, 7(3):269–272, 1995. · Zbl 0834.05030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.