Back to Results
First PageMeta Content
Submodular set function / Order theory / Matroid / Linear programming / Greedy algorithm / XTR / Monotonic function / Greedoid / Ordinal optimization / Mathematics / Mathematical analysis / Matroid theory


Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s
Add to Reading List

Document Date: 2012-11-25 12:04:59


Open Document

File Size: 462,90 KB

Share Result on Facebook

Company

Let us / /

Country

Sudan / /

IndustryTerm

k-exchange systems / local search algorithm / oblivious local search / integral solutions / randomized local search algorithm / non-oblivious local search algorithm / local search phase / non-oblivious local search routine / greedy and local search algorithms / approximation algorithm / greedy algorithm / arbitrary solution / local search / local search iterations / locally-optimal solution / continuous greedy algorithm / fractional solution / non-oblivious local search / polynomial time local search algorithm / steepest descent algorithm / /

Person

Justin Ward / /

Position

Related work Fisher / second author / /

Product

Pentax K-x Digital Camera / /

Technology

polynomial time local search algorithm / local search algorithm / main algorithm / 5 Main algorithm / steepest descent algorithm / resulting algorithm / 1/2 approximation algorithm / approximation algorithm / 1/e approximation algorithm / randomized local search algorithm / continuous greedy algorithm / greedy algorithm / greedy and local search algorithms / non-oblivious local search algorithm / /

SocialTag