OpenAlex
PricingAboutJobs
Log inGet started
Work

Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms

HTML PDF

Year: 2010
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Internet and Network Economics: 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings
DOI: 10.1007/978-3-642-17572-5_20
Authors: Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar
Institutions: Carnegie Mellon University, Microsoft Research New England (United States), Princeton University, Microsoft (United States)
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: constant-factor approximation, matroid constraints, knapsack constraints, secretary problem, online algorithms, greedy algorithm, computational advertising, auctions

Open Access status: green
OpenAlex ID: W1503396090
FWCI: 8.544
Cites: 40
Cited by: 231
Related to: 9
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security