Approximate separable multichoice optimization over monotone systems
From MaRDI portal
Publication:2673246
DOI10.1016/j.disopt.2021.100629OpenAlexW3130421935MaRDI QIDQ2673246
Syed M. Meesum, Martin Koutecký, Asaf Levin, Shmuel Onn
Publication date: 9 June 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100629
combinatorial optimizationmatchingapproximation algorithmload balancingindependence systemcongestion routing
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Finding paths with minimum shared edges
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- The minimum vulnerability problem
- A polynomial oracle-time algorithm for convex integer minimization
- Nonlinear discrete optimization. An algorithmic theory
- Shifted matroid optimization
- A logarithmic approximation for polymatroid congestion games
- The unimodular intersection problem
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- A class of games possessing pure-strategy Nash equilibria
- The complexity of welfare maximization in congestion games
- The Design of Approximation Algorithms
- Approximate Nonlinear Optimization over Weighted Independence Systems
- Planar 3DM is NP-complete
- The NP-Completeness of Edge-Coloring
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Totally Unimodular Congestion Games
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- The Parameterized Complexity of the Minimum Shared Edges Problem
- Convex separable optimization is not much harder than linear optimization
- Parameterized shifted combinatorial optimization
This page was built for publication: Approximate separable multichoice optimization over monotone systems
