Correction to: ``Guess free maximization of submodular and linear sums

DOI10.1007/S00453-022-01028-5MaRDI QIDQ2088596OpenAlexFDO

Authors Moran Feldman

Publication date 6 October 2022

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-022-01028-5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Guess free maximization of submodular and linear sums
• Guess free maximization of submodular and linear sums
• Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value
• Approximation guarantees for deterministic maximization of submodular function with a matroid constraint
• Correction to: ``Submodular functions and rooted trees
• Erratum: A correction to Parallel approximation algorithms by positive linear programming
• Erratum to: ``Greedy matching: guarantees and limitations
• Submodular Maximization Through the Lens of Linear Programming
• On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint

Cites work

• Guess free maximization of submodular and linear sums

Cited in

(4)

• The regularized submodular maximization via the Lyapunov method
• A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
• Guess free maximization of submodular and linear sums
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization

This page was built for publication: Correction to: ``Guess free maximization of submodular and linear sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2088596)