Correction to: ``Guess free maximization of submodular and linear sums''
type: Item
instance of: scholarly article
title: Correction to: ``Guess free maximization of submodular and linear sums''
author: Moran Feldman
published in: Algorithmica
publication date: 2022-10-06T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7596614
MaRDI profile type: Publication
full work available at URL: s00453-022-01028-5
OpenAlex ID: W4293740025
cites work: Guess free maximization of submodular and linear sums
DOI: 10.1007/S00453-022-01028-5
Recommended article: Guess free maximization of submodular and linear sums
Recommended article: Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value''
Recommended article: Approximation guarantees for deterministic maximization of submodular function with a matroid constraint
Recommended article: Correction to: ``Submodular functions and rooted trees''
Recommended article: Erratum: A correction to ''Parallel approximation algorithms by positive linear programming''
Recommended article: Erratum to: ``Greedy matching: guarantees and limitations''
Recommended article: Submodular Maximization Through the Lens of Linear Programming
Recommended article: On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint
description: scientific article; zbMATH DE number 7596614