Greedy in Approximation Algorithms
From MaRDI portal
Publication:5449556
DOI10.1007/11841036_48zbMath1131.68594OpenAlexW1578891227MaRDI QIDQ5449556
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11841036_48
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (25)
Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint ⋮ The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings ⋮ The Power of Subsampling in Submodular Maximization ⋮ Randomized strategies for cardinality robustness in the knapsack problem ⋮ Integrality gaps for colorful matchings ⋮ Unified Greedy Approximability beyond Submodular Maximization ⋮ On the approximation ability of evolutionary optimization with application to minimum set cover ⋮ Unified greedy approximability beyond submodular maximization ⋮ Unnamed Item ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ A constrained two-stage submodular maximization ⋮ Bi-criteria and approximation algorithms for restricted matchings ⋮ Ranking with Fairness Constraints ⋮ Surrogate optimization for \(p\)-norms ⋮ On the intersection of independence systems ⋮ Robust Independence Systems ⋮ Robust Randomized Matchings ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Superstring Graph: A New Approach for Genome Assembly ⋮ Efficient Approximation Algorithms for Weighted $b$-Matching ⋮ An approximation algorithm for a general class of multi-parametric optimization problems ⋮ Stability and Recovery for Independence Systems ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards ⋮ Superstrings with multiplicities ⋮ General bounds for incremental maximization
This page was built for publication: Greedy in Approximation Algorithms
