diff options
| -rw-r--r-- | papers/filmus2012.pdf | bin | 0 -> 449479 bytes | |||
| -rw-r--r-- | papers/filmus2012tight.pdf | bin | 0 -> 279567 bytes | |||
| -rw-r--r-- | papers/filmus2014.pdf | bin | 0 -> 375796 bytes | |||
| -rw-r--r-- | sessions.csv | 1 | ||||
| -rw-r--r-- | sub.bib | 33 |
5 files changed, 25 insertions, 9 deletions
diff --git a/papers/filmus2012.pdf b/papers/filmus2012.pdf Binary files differnew file mode 100644 index 0000000..aa74b94 --- /dev/null +++ b/papers/filmus2012.pdf diff --git a/papers/filmus2012tight.pdf b/papers/filmus2012tight.pdf Binary files differnew file mode 100644 index 0000000..64ae5fe --- /dev/null +++ b/papers/filmus2012tight.pdf diff --git a/papers/filmus2014.pdf b/papers/filmus2014.pdf Binary files differnew file mode 100644 index 0000000..0db0757 --- /dev/null +++ b/papers/filmus2014.pdf diff --git a/sessions.csv b/sessions.csv index 763bb80..a0ed4f1 100644 --- a/sessions.csv +++ b/sessions.csv @@ -4,3 +4,4 @@ date,speaker,refs,summary 2015-02-24,Jean,"calinescu2007","extensions (multilinear, concave closure), Poisson clocks, maximizing sum of weighted rank functions under matroid constraint" 2015-02-25,Eric,"vondrak2008,calinescu2011","continuous greedy algorithm, maximizing monotone submodular function under matroid constraint, submodular welfare problem" 2015-03-05,Bo,"vondrak2011","contention resolution schemes, non-monotone submodular maximization over independent set systems" +2015-03-12,Thibaut,"filmus2012,filmus2012tight,filmus2014","combinatorial algorithm for coverage (and submodular) maximization over a matroid" @@ -69,15 +69,6 @@ publisher={Springer} } -@inproceedings{filmus2012, - title={A tight combinatorial algorithm for submodular maximization subject to a matroid constraint}, - author={Filmus, Yuval and Ward, Justin}, - booktitle={Foundations of Computer Science (FOCS)}, - pages={659--668}, - year={2012}, - organization={IEEE} -} - @inproceedings{vondrak2011, title={Submodular function maximization via the multilinear relaxation and contention resolution schemes}, author={Vondr{\'a}k, Jan and Chekuri, Chandra and Zenklusen, Rico}, @@ -138,3 +129,27 @@ year={2008}, organization={ACM} } + +@inproceedings{filmus2012, + author = {Yuval Filmus and Justin Ward}, + title = {Maximum coverage over a matroid}, + booktitle = {29th Symposium on Theoretical Aspects of Computer Science ({STACS} 2012)}, + year = {2012} +} + +@inproceedings{filmus2012tight, + author = {Yuval Filmus and Justin Ward}, + title = {A tight combinatorial algorithm for submodular maximization subject to a matroid constraint}, + booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science ({FOCS} 2012)}, + year = {2012} +} + +@article{filmus2014, + author = {Yuval Filmus and Justin Ward}, + title = {Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search}, + journal = {SIAM Journal on Computing}, + volume = {43}, + issue = {2}, + year = {2014}, + pages = {514--542} +} |
