OpenAlex
PricingAboutJobs
Log inGet started
Work

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization

HTML

Year: 2012
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/focs.2012.73
Authors: Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
Institutions: Tel Aviv University, Technion – Israel Institute of Technology, Microsoft (United States)
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: submodular optimization, randomized approximation algorithms, linear-time algorithms, hardness of approximation, greedy algorithm, MaxCut, MaxSAT, facility location

Open Access status: closed
OpenAlex ID: W2158557760
FWCI: 18.44
Cites: 50
Cited by: 261
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms