Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
From MaRDI portal
Cites work
- k-edge-connectivity: approximation and LP relaxation
- A catalog of steiner tree formulations
- A counterexample to an integer analogue of Carathéodory's theorem
- A deterministic almost-linear time algorithm for minimum-cost flow
- A Min-Max Theorem on Tournaments
- A new polynomial-time algorithm for linear programming
- A note on Elkin's improvement of Behrend's construction
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- A six-coloring of the plane
- A strongly polynomial algorithm for generalized flow maximization
- Additive combinatorics
- Aggregating inconsistent information: ranking and clustering
- All unit-distance graphs of order 6197 are 6-colorable
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- An O( k)-approximation for directed Steiner tree in planar graphs
- An analysis of the greedy algorithm for the submodular set covering problem
- An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem
- An improved approximation guarantee for prize-collecting TSP
- An improved construction of progression-free sets
- An integer analogue of Carathéodory's theorem
- Another six-coloring of the plane
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximating the single source unsplittable min-cost flow problem
- Caps and progression-free sets in \(\mathbb{Z}_m^n\)
- Chain-constrained spanning trees
- Clustering with qualitative information
- Coloring tournaments with few colors: algorithms and complexity
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Compact oracles for reachability and approximate distances in planar digraphs
- Computational complexity of parametric linear programming
- Congruency-constrained TU problems beyond the bimodular case
- Constant factor approximation for subset feedback set problems via a new LP relaxation
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- Convex Combinations of Single Source Unsplittable Flows
- Correlation clustering
- Correlation clustering with Sherali-Adams
- Cost allocation for set covering: the happy nucleolus
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Cut-sufficient directed 2-commodity multiflow topologies
- Determinant maximization via matroid intersection algorithms
- Every finite distributive lattice is a set of stable matchings
- Extending the continuum of six-colorings
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Handbook of Approximation Algorithms and Metaheuristics
- Handling correlated rounding error via preclustering: a 1.73-approximation for correlation clustering
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 3558960 (Why is no real title available?)
- scientific article; zbMATH DE number 3606472 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 841592 (Why is no real title available?)
- scientific article; zbMATH DE number 866016 (Why is no real title available?)
- scientific article; zbMATH DE number 866031 (Why is no real title available?)
- scientific article; zbMATH DE number 1439408 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- Improving Christofides' algorithm for the s-t path TSP
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
- Inapproximability of maximum edge biclique, maximum balanced biclique and minimum k-cut from the small set expansion hypothesis
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Integer program with bimodular matrix
- Interior point methods are not worse than simplex
- Local search for weighted tree augmentation and Steiner tree
- Mathematical problems for the next century
- Max flows in O(nm) time, or better
- Maximum flow and minimum-cost flow in almost-linear time
- Monotonizing linear programs with up to two nonzeroes per column
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- New asymptotics for bipartite Turán numbers
- New Bounds for the Integer Carathéodory Rank
- Normality and covering properties of affine semigroups
- NP-completeness of some edge-disjoint paths problems
- On cap sets and the group-theoretic approach to matrix multiplication
- On defining sets of vertices of the hypercube by linear inequalities
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On lattice width of lattice-free polyhedra and height of Hilbert bases
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
- On Padberg's conjecture about almost totally unimodular matrices
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Some Sequences of Integers
- On sunflowers and matrix multiplication
- On the co-NP-completeness of the zonotope containment problem
- On the minors of an incidence matrix and Smith normal form
- On the shadow simplex method for curved polyhedra
- On the single-source unsplittable flow problem
- Open Problems in Mathematics
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Optimum branchings
- Pivot selection methods of the Devex LP code
- Popular branchings and their dual certificates
- Popular Matchings
- Popular progression differences in vector spaces II
- Proximity and flatness bounds for linear integer optimization
- Single source unsplittable flows with arc-wise lower and upper bounds
- Single-source unsplittable flows in planar graphs
- Steiner tree approximation via iterative randomized rounding
- Strong bounds for 3-progressions
- The chromatic number of the plane is at least 5: a new proof
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The Mathematical Coloring Book
- The maximum edge biclique problem is NP-complete
- The New Mathematical Coloring Book
- The popular assignment problem: when cardinality is more important than popularity
- Total unimodularity and the Euler-subgraph problem
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- What percent of the plane can be properly 5- and 6-colored?
- Worst case behavior of the steepest edge simplex method
This page was built for publication: Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977149)
