scientific article; zbMATH DE number 6783453

zbMath1377.90071MaRDI QIDQ5365101

Chandra Chekuri, Jan Vondrák, Rico Zenklusen

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133118

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)

Related Items (31)

Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint ⋮ Random Walks in Polytopes and Negative Dependence ⋮ Maximizing Symmetric Submodular Functions ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ Measured continuous greedy with differential privacy ⋮ Submodular Stochastic Probing on Matroids ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Unnamed Item ⋮ New approaches to multi-objective optimization ⋮ A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice ⋮ Submodular Maximization Through the Lens of Linear Programming ⋮ An Improved Analysis of Local Search for Max-Sum Diversification ⋮ A parameterized approximation scheme for generalized partial vertex cover ⋮ Unnamed Item ⋮ Bi-criteria and approximation algorithms for restricted matchings ⋮ Budgeted colored matching problems ⋮ Bulk-robust combinatorial optimization ⋮ \(\ell_1\)-sparsity approximation bounds for packing integer programs ⋮ Approximate multi-matroid intersection via iterative refinement ⋮ Generalized Center Problems with Outliers ⋮ Scheduling Resources for Throughput Maximization ⋮ Randomized Rounding in the Presence of a Cardinality Constraint ⋮ An almost optimal approximation algorithm for monotone submodular multiple knapsack ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints ⋮ Concentration inequalities for nonlinear matroid intersection ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint

This page was built for publication: