Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- 25 June 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On maximizing welfare when utility functions are subadditivePublished by Association for Computing Machinery (ACM) ,2006
- Tight approximation algorithms for maximum general assignment problemsPublished by Association for Computing Machinery (ACM) ,2006
- A Recursive Greedy Algorithm for Walks in Directed GraphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Polynomial Time Approximation Scheme for the Multiple Knapsack ProblemSIAM Journal on Computing, 2005
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance GuaranteeJournal of Combinatorial Optimization, 2004
- Maximum Coverage Problem with Group Budget Constraints and ApplicationsLecture Notes in Computer Science, 2004
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- An Analysis of the Greedy Heuristic for Independence SystemsAnnals of Discrete Mathematics, 1978
- An analysis of approximations for maximizing submodular set functions—IIPublished by Springer Science and Business Media LLC ,1978
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977