Back to Results
First PageMeta Content
Mathematical optimization / Submodular set function / Operations research / Convex optimization / Matroid / Linear programming / Greedy algorithm / Algorithm / Greedoid / Mathematics / Matroid theory / Combinatorics


Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus∗ and Justin Ward† December 30, 2013 Abstract
Add to Reading List

Document Date: 2013-12-30 15:39:21


Open Document

File Size: 474,06 KB

Share Result on Facebook

Country

Sudan / /

/

IndustryTerm

k-exchange systems / greedy solution / α-approximate solution / local search algorithm / integral solutions / randomized local search algorithm / non-oblivious local search algorithm / locallyoptimal solution / local search phase / non-oblivious local search routine / good sub-solutions / randomized polynomial time local search algorithm / greedy and local search algorithms / The resulting algorithm / approximation algorithm / polynomial time algorithm / classical local search / greedy algorithm / non-oblivious local search approach / arbitrary solution / local search / present fast algorithms / continuous greedy algorithm / fractional solution / constant-factor approximation algorithms / Non-oblivious local search / /

Person

Ai / Justin Ward / /

Position

Related work Fisher / second author / /

Product

Pentax K-x Digital Camera / /

Technology

local search algorithm / Wolfe algorithm / resulting algorithm / polynomial time algorithm / approximation algorithm / constant-factor approximation algorithms / randomized polynomial time local search algorithm / 1/e approximation algorithm / randomized local search algorithm / continuous greedy algorithm / 2/5approximation algorithm / greedy algorithm / basic / non-oblivious local search algorithm / greedy and local search algorithms / 5 3 The algorithm / 1/2-approximation algorithm / 0.356-approximation algorithm / non-oblivious local search algorithm / The resulting algorithm / /

SocialTag