Iterative methods in combinatorial optimization.
From MaRDI portal
Recommendations
Cited in
(78)- LP-relaxations for tree augmentation
- Complexity of some graph-based bounds on the probability of a union of events
- \(k\)-trails: recognition, complexity, and approximations
- Independent sets and hitting sets of bicolored rectangular families
- Algorithms for hierarchical and semi-partitioned parallel scheduling
- Upper and lower degree-constrained graph orientation with minimum penalty
- The minimum degree group Steiner problem
- Socially fair network design via iterative rounding
- Nearly optimal robust secret sharing against rushing adversaries
- A simple LP-based approximation algorithm for the matching augmentation problem
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
- Approximation and hardness of shift-bribery
- On tree-constrained matchings and generalizations
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
- Scheduling problems over a network of machines
- Approximating minimum-cost connected \(T\)-joins
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Computational theory of iterative methods.
- Recoverable robust spanning tree problem under interval uncertainty representations
- Integrality gaps for colorful matchings
- Approximating minimum cost source location problems with local vertex-connectivity demands
- Bi-criteria and approximation algorithms for restricted matchings
- On the tree augmentation problem
- On fair covering and hitting problems
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- Analyzing Residual Random Greedy for monotone submodular maximization
- Arboricity games: the core and the nucleolus
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives
- Iterative methods in combinatorial optimization
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Bravely, moderately: a common theme in four recent works
- \(k\)-trails: recognition, complexity, and approximations
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Approximation algorithms for multi-budgeted network design problems
- On some network design problems with degree constraints
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
- Approximating Minimum Cost Connectivity Orientation and Augmentation
- Random walks in polytopes and negative dependence
- Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
- Degree constrained node-connectivity problems
- A Lottery Model for Center-Type Problems With Outliers
- A lottery model for center-type problems with outliers
- Approximating unique games using low diameter graph decomposition
- Bounded Degree Group Steiner Tree Problems
- Generalized assignment via submodular optimization with reserved capacity
- A Spectral Approach to Network Design
- scientific article; zbMATH DE number 7205039 (Why is no real title available?)
- Assortment optimization under the paired combinatorial logit model
- A note on iterated rounding for the survivable network design problem
- Uniform s-Cross-Intersecting Families
- Approximating minimum bounded degree spanning trees to within one of optimal
- The entropy rounding method in approximation algorithms
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Approximate multi-matroid intersection via iterative refinement
- Proper orientations and proper chromatic number
- Tight approximation algorithms for geometric bin packing with skewed items
- On colorful vertex and edge cover problems
- Resource management in device-to-device communications
- Eigenpolytope Universality and Graphical Designs
- Discrepancy theory and related algorithms
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- Hardness and approximation of submodular minimum linear ordering problems
- The parameterized complexity of the survivable network design problem
- (Near)-optimal algorithms for sparse separable convex integer programs
- b-matching interdiction problem on bipartite graphs with unit weight and multi-dimensional budgets
- A constant factor approximation for directed feedback vertex set in graphs of bounded genus
- Degrees and network design: new problems and approximations
- Packing cycles in planar and bounded-genus graphs
- Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
- Sparse graphical designs via linear programming
- On the partial convexification of the low-rank spectral optimization: rank bounds and algorithms
- On the partial convexification for low-rank spectral optimization: rank bounds and algorithms
- Tight guarantees for cut-relative survivable network design via a decomposition technique
- Bicriteria approximation for k-edge-connectivity
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
- Coupled and \(k\)-sided placements: generalizing generalized assignment
- A unified algorithm for degree bounded survivable network design
This page was built for publication: Iterative methods in combinatorial optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087101)
