Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximate modularity revisited

From MaRDI portal
Publication:4978043
Jump to:navigation, search

DOI10.1145/3055399.3055476zbMath1370.68150arXiv1612.02034OpenAlexW2560393541MaRDI QIDQ4978043

Inbal Talgam-Cohen, Michal Feldman, Uriel Feige

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.02034


zbMATH Keywords

learninglinear functionsset functions


Mathematics Subject Classification ID

Computational learning theory (68Q32) Real- or complex-valued set functions (28A10) Combinatorial optimization (90C27)


Related Items (3)

On additive approximate submodularity ⋮ When Are Welfare Guarantees Robust ⋮ Approximate Modularity Revisited




This page was built for publication: Approximate modularity revisited

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4978043&oldid=19423840"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 10:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki