Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (Q347232): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Approximating the independence number via the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of locally sparse graphs and a Ramsey type problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lovász Theta function for Independent Sets in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation resistance from pairwise independent subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of sparse graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4171/owr/2014/51 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4241216116 / rank
 
Normal rank

Latest revision as of 08:40, 30 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014.
scientific article

    Statements

    Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (English)
    0 references
    30 November 2016
    0 references
    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.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references