466 lines
14 KiB
BibTeX
466 lines
14 KiB
BibTeX
@inbook{Recski2011,
|
|
author = "Recski, Andr{\'A}s",
|
|
editor = "Barlotti, A.",
|
|
title = "Engineering Applications of Matroids - A Survey ",
|
|
bookTitle = "Matroid Theory and its Applications",
|
|
year = 2011,
|
|
publisher = "Springer Berlin Heidelberg",
|
|
address = "Berlin, Heidelberg",
|
|
pages = "300--321",
|
|
isbn = "978-3-642-11110-5",
|
|
doi = "10.1007/978-3-642-11110-5_6",
|
|
url = "https://doi.org/10.1007/978-3-642-11110-5_6"
|
|
}
|
|
|
|
@book{ams1996matroid,
|
|
title = {Matroid Theory: AMS-IMS-SIAM Joint Summer Research
|
|
Conference on Matroid Theory, July 2-6, 1995,
|
|
University of Washington, Seattle},
|
|
author = {AMS-IMS-SIAM Joint Summer Research Conference on
|
|
Matroid, Theory and Bonin, J.E. and Oxley, J.G. and
|
|
Servatius, B. and AMS-IMS-SIAM Joint Summer Research
|
|
Conference on Matroid Theory and Oxley,
|
|
P.M.M.D.J.G. and American Mathematical Society},
|
|
isbn = 9780821805084,
|
|
lccn = 96018251,
|
|
series = {Contemporary mathematics - American Mathematical
|
|
Society},
|
|
year = 1996,
|
|
publisher = {American Mathematical Society}
|
|
}
|
|
|
|
@article{benati2003,
|
|
title = {An Improved Branch \& Bound Method for the
|
|
Uncapacitated Competitive Location Problem},
|
|
volume = 122,
|
|
doi = {10.1023/a:1026182020346},
|
|
number = {1/4},
|
|
journal = {Annals of Operations Research},
|
|
author = {Benati, Stefano},
|
|
year = 2003,
|
|
pages = {43-58}
|
|
}
|
|
|
|
@inproceedings{combinatorialauctions2006,
|
|
author = {Dobzinski, Shahar and Schapira, Michael},
|
|
title = {An Improved Approximation Algorithm for
|
|
Combinatorial Auctions with Submodular Bidders},
|
|
year = 2006,
|
|
isbn = 0898716055,
|
|
publisher = {Society for Industrial and Applied Mathematics},
|
|
address = {USA},
|
|
booktitle = {Proceedings of the Seventeenth Annual ACM-SIAM
|
|
Symposium on Discrete Algorithm},
|
|
pages = {1064-1073},
|
|
numpages = 10,
|
|
location = {Miami, Florida},
|
|
series = {SODA '06}
|
|
}
|
|
|
|
@article{datastructuresandalg2012,
|
|
doi = {10.48550/ARXIV.1207.0560},
|
|
url = {https://arxiv.org/abs/1207.0560},
|
|
author = {Iyer, Rishabh and Bilmes, Jeff},
|
|
keywords = {Data Structures and Algorithms (cs.DS), Machine
|
|
Learning (cs.LG), FOS: Computer and information
|
|
sciences, FOS: Computer and information sciences},
|
|
title = {Algorithms for Approximate Minimization of the
|
|
Difference Between Submodular Functions, with
|
|
Applications},
|
|
publisher = {arXiv},
|
|
year = 2012,
|
|
copyright = {Creative Commons Public Domain Dedication and
|
|
Certification}
|
|
}
|
|
|
|
@inproceedings{edmonds2001,
|
|
title = {Submodular Functions, Matroids, and Certain
|
|
Polyhedra},
|
|
author = {Jack Edmonds},
|
|
booktitle = {Combinatorial Optimization},
|
|
year = 2001
|
|
}
|
|
|
|
@InProceedings{entropictracelogdet2017,
|
|
author = "Fitzsimons, Jack and Granziol, Diego and Cutajar,
|
|
Kurt and Osborne, Michael and Filippone, Maurizio
|
|
and Roberts, Stephen",
|
|
editor = "Ceci, Michelangelo and Hollm{\'e}n, Jaakko and
|
|
Todorovski, Ljup{\v{c}}o and Vens, Celine and
|
|
D{\v{z}}eroski, Sa{\v{s}}o",
|
|
title = "Entropic Trace Estimates for Log Determinants",
|
|
booktitle = "Machine Learning and Knowledge Discovery in
|
|
Databases",
|
|
year = 2017,
|
|
publisher = "Springer International Publishing",
|
|
address = "Cham",
|
|
pages = "323-338",
|
|
isbn = "978-3-319-71249-9"
|
|
}
|
|
|
|
@article{feigemirroknivondrak2011,
|
|
title = {Maximizing Non-monotone submodular functions},
|
|
volume = 40,
|
|
doi = {10.1137/090779346},
|
|
number = 4,
|
|
journal = {SIAM Journal on Computing},
|
|
author = {Feige, Uriel and Mirrokni, Vahab S. and Vondr\'ak,
|
|
Jan},
|
|
year = 2011,
|
|
pages = {1133-1153}
|
|
}
|
|
|
|
@book{fujishige2005,
|
|
title = {Submodular functions and optimization},
|
|
publisher = {Elsevier},
|
|
author = {Fujishige, Satoru},
|
|
year = 2005
|
|
}
|
|
|
|
@inbook{gareyjohnson2003,
|
|
place = {New York},
|
|
title = {Appendix: A List of NP-Complete Problems},
|
|
booktitle = {Computers and intractability: A guide to the theory
|
|
of NP - completeness},
|
|
publisher = {W.H. Freeman and Co.},
|
|
author = {Garey, Michael R. and Johnson, David S.},
|
|
year = 2003,
|
|
pages = {187-288}
|
|
}
|
|
|
|
@article{generalizedsubmodular2022,
|
|
title = {Generalized submodular information measures:
|
|
Theoretical properties, examples, optimization
|
|
algorithms, and applications},
|
|
volume = 68,
|
|
doi = {10.1109/tit.2021.3123944},
|
|
number = 2,
|
|
journal = {IEEE Transactions on Information Theory},
|
|
author = {Iyer, Rishabh and Khargonkar, Ninad and Bilmes, Jeff
|
|
and Asnani, Himanshu},
|
|
year = 2022,
|
|
pages = {752-781}
|
|
}
|
|
|
|
@article{goldengoringhosh2005,
|
|
title = {A multilevel search algorithm for the maximization
|
|
of submodular functions applied to the quadratic
|
|
cost partition problem},
|
|
volume = 32,
|
|
DOI = {10.1007/s10898-004-5909-z},
|
|
number = 1,
|
|
journal = {Journal of Global Optimization},
|
|
author = {Goldengorin, Boris and Ghosh, Diptesh},
|
|
year = 2005,
|
|
pages = {65-82}
|
|
}
|
|
|
|
@article{iri1979,
|
|
title = {A review of recent work in Japan on principal
|
|
partitions of matroids and their applications},
|
|
volume = 319,
|
|
doi = {10.1111/j.1749-6632.1979.tb32805.x},
|
|
number = {1 Second Intern},
|
|
journal = {Annals of the New York Academy of Sciences},
|
|
author = {Iri, Masao},
|
|
year = 1979,
|
|
pages = {306-319}
|
|
}
|
|
|
|
@book{lawler2004,
|
|
place = {Mineola, NY},
|
|
title = {Combinatorial Optimization: Networks and matroids},
|
|
publisher = {Dover Publications},
|
|
author = {Lawler, Eugene},
|
|
year = 2004
|
|
}
|
|
|
|
@misc{logdeterminant2017,
|
|
doi = {10.48550/ARXIV.1704.01445},
|
|
url = {https://arxiv.org/abs/1704.01445},
|
|
author = {Fitzsimons, Jack and Cutajar, Kurt and Osborne,
|
|
Michael and Roberts, Stephen and Filippone,
|
|
Maurizio},
|
|
keywords = {Machine Learning (stat.ML), Numerical Analysis
|
|
(math.NA), Computation (stat.CO), FOS: Computer and
|
|
information sciences, FOS: Computer and information
|
|
sciences, FOS: Mathematics, FOS: Mathematics},
|
|
title = {Bayesian Inference of Log Determinants},
|
|
publisher = {arXiv},
|
|
year = 2017,
|
|
copyright = {arXiv.org perpetual, non-exclusive license}
|
|
}
|
|
|
|
@incollection{maximizingsubmodularsetfunctions1981,
|
|
title = {Maximizing Submodular Set Functions: Formulations
|
|
and Analysis of Algorithms*},
|
|
editor = {P. Hansen},
|
|
series = {North-Holland Mathematics Studies},
|
|
publisher = {North-Holland},
|
|
volume = 59,
|
|
pages = {279-301},
|
|
year = 1981,
|
|
booktitle = {Annals of Discrete Mathematics (11)},
|
|
issn = {0304-0208},
|
|
doi = {10.1016/S0304-0208(08)73471-6},
|
|
url =
|
|
{https://www.sciencedirect.com/science/article/pii/S0304020808734716},
|
|
author = {G.L. Nemhauser and L.A. Wolsey},
|
|
}
|
|
|
|
@article{maxmizingapproximation2019,
|
|
title = {Maximizing submodular or monotone approximately
|
|
submodular functions by multi-objective evolutionary
|
|
algorithms},
|
|
journal = {Artificial Intelligence},
|
|
volume = 275,
|
|
pages = {279-294},
|
|
year = 2019,
|
|
issn = {0004-3702},
|
|
doi = {10.1016/j.artint.2019.06.005},
|
|
url =
|
|
{https://www.sciencedirect.com/science/article/pii/S0004370219301535},
|
|
author = {Chao Qian and Yang Yu and Ke Tang and Xin Yao and
|
|
Zhi-Hua Zhou},
|
|
keywords = {Evolutionary algorithms, Submodular optimization,
|
|
Multi-objective evolutionary algorithms, Running
|
|
time analysis, Computational complexity},
|
|
}
|
|
|
|
@book{murota2010,
|
|
place = {Berlin},
|
|
title = {Matrices and matroids for systems analysis},
|
|
publisher = {Springer},
|
|
author = {Murota, Kazuo},
|
|
year = 2010
|
|
}
|
|
|
|
@article{nemhauserwolseyfisher1978,
|
|
title = {An analysis of approximations for maximizing
|
|
submodular set functions-I},
|
|
volume = 14,
|
|
DOI = {10.1007/bf01588971},
|
|
number = 1,
|
|
journal = {Mathematical Programming},
|
|
author = {Nemhauser, G. L. and Wolsey, L. A. and Fisher,
|
|
M. L.},
|
|
year = 1978,
|
|
pages = {265-294}
|
|
}
|
|
|
|
@misc{pagariapezzoli2021,
|
|
doi = {10.48550/ARXIV.2105.04214},
|
|
url = {https://arxiv.org/abs/2105.04214},
|
|
author = {Pagaria, Roberto and Pezzoli, Gian Marco},
|
|
keywords = {Algebraic Geometry (math.AG), Combinatorics
|
|
(math.CO), FOS: Mathematics, FOS: Mathematics,
|
|
05B35, 14N20, 52C35},
|
|
title = {Hodge Theory for Polymatroids},
|
|
publisher = {arXiv},
|
|
year = 2021,
|
|
copyright = {Creative Commons Attribution 4.0 International}
|
|
}
|
|
|
|
@article{rankmetricqpoly2019,
|
|
title = {Rank-metric codes and Q-polymatroids},
|
|
volume = 52,
|
|
doi = {10.1007/s10801-019-00889-4},
|
|
number = 1,
|
|
journal = {Journal of Algebraic Combinatorics},
|
|
author = {Gorla, Elisa and Jurrius, Relinde and L{\'o}pez,
|
|
Hiram H. and Ravagnani, Alberto},
|
|
year = 2019,
|
|
pages = {1-19}
|
|
}
|
|
|
|
@book{schrijver2003,
|
|
place = {Berlin},
|
|
title = {Combinatorial optimization: Polyhedra and
|
|
efficiency},
|
|
publisher = {Springer},
|
|
author = {Schrijver, Alexander},
|
|
year = 2003
|
|
}
|
|
|
|
@article{setcovering1970,
|
|
ISSN = {0030364X, 15265463},
|
|
URL = {http://www.jstor.org/stable/169305},
|
|
author = {Egon Balas and Manfred W. Padberg},
|
|
journal = {Operations Research},
|
|
number = 6,
|
|
pages = {1152-1161},
|
|
publisher = {INFORMS},
|
|
title = {On the Set-Covering Problem},
|
|
volume = 20,
|
|
year = 1972
|
|
}
|
|
|
|
@article{shannon1948,
|
|
title = {A mathematical theory of communication},
|
|
volume = 27,
|
|
doi = {10.1002/j.1538-7305.1948.tb00917.x},
|
|
number = 4,
|
|
journal = {Bell System Technical Journal},
|
|
author = {Shannon, C. E.},
|
|
year = 1948,
|
|
month = 10,
|
|
pages = {623-656}
|
|
}
|
|
|
|
@inbook{steenseebach1979,
|
|
place = {Estados Unidos},
|
|
booktitle = {Counterexamples in topology},
|
|
publisher = {Springer},
|
|
author = {Steen, Lynn Arthur and Seebach, Arthur},
|
|
year = 1979,
|
|
pages = {34-40}
|
|
}
|
|
|
|
@article{submodularcombinatorialinformation2021,
|
|
author = {Rishabh K. Iyer and Ninad Khargoankar and Jeff
|
|
A. Bilmes and Himanshu Asanani},
|
|
title = {Submodular Combinatorial Information Measures with
|
|
Applications in Machine Learning},
|
|
journal = {CoRR},
|
|
volume = {abs/2006.15412},
|
|
year = 2020,
|
|
url = {https://arxiv.org/abs/2006.15412},
|
|
eprinttype = {arXiv},
|
|
eprint = {2006.15412},
|
|
timestamp = {Wed, 01 Jul 2020 15:21:23 +0200},
|
|
biburl =
|
|
{https://dblp.org/rec/journals/corr/abs-2006-15412.bib},
|
|
bibsource = {dblp computer science bibliography,
|
|
https://dblp.org}
|
|
}
|
|
|
|
@article{submodularknapsackpolytope2009,
|
|
title = {The submodular knapsack polytope},
|
|
journal = {Discrete Optimization},
|
|
volume = 6,
|
|
number = 4,
|
|
pages = {333-344},
|
|
year = 2009,
|
|
issn = {1572-5286},
|
|
DOI = {10.1016/j.disopt.2009.03.002},
|
|
url =
|
|
{https://www.sciencedirect.com/science/article/pii/S157252860900019X},
|
|
author = {Alper Atamt\"urk and Vishnu Narayanan},
|
|
}
|
|
|
|
@inproceedings{submodularoptimization2013,
|
|
author = {Iyer, Rishabh and Bilmes, Jeff},
|
|
title = {Submodular Optimization with Submodular Cover and
|
|
Submodular Knapsack Constraints},
|
|
year = 2013,
|
|
publisher = {Curran Associates Inc.},
|
|
address = {Red Hook, NY, USA},
|
|
booktitle = {Proceedings of the 26th International Conference on
|
|
Neural Information Processing Systems - Volume 2},
|
|
pages = {2436-2444},
|
|
numpages = 9,
|
|
location = {Lake Tahoe, Nevada},
|
|
series = {NIPS'13},
|
|
}
|
|
|
|
@article{submodularwelfare2010,
|
|
author = {Feige, Uriel and Vondr\'ak, Jan},
|
|
year = 2010,
|
|
month = 01,
|
|
pages = {247-290},
|
|
title = {The Submodular Welfare Problem with Demand Queries.},
|
|
volume = 6,
|
|
journal = {Theory of Computing},
|
|
doi = {10.4086/toc.2010.v006a011}
|
|
}
|
|
|
|
@misc{submultiwaypartition2011,
|
|
doi = {10.48550/ARXIV.1105.2048},
|
|
url = {https://arxiv.org/abs/1105.2048},
|
|
author = {Chekuri, Chandra and Ene, Alina},
|
|
title = {Approximation Algorithms for Submodular Multiway
|
|
Partition},
|
|
publisher = {arXiv},
|
|
year = 2011,
|
|
copyright = {arXiv.org perpetual, non-exclusive license}
|
|
}
|
|
|
|
@article{sviridenkovondrakward2014,
|
|
title = {Optimal approximation for submodular and
|
|
supermodular optimization with bounded curvature},
|
|
DOI = {10.1137/1.9781611973730.76},
|
|
journal = {Proceedings of the Twenty-Sixth Annual ACM-SIAM
|
|
Symposium on Discrete Algorithms},
|
|
author = {Sviridenko, Maxim and Vondr\'ak, Jan and Ward,
|
|
Justin},
|
|
year = 2014
|
|
}
|
|
|
|
@article{tutte196615,
|
|
title = {On the algebraic theory of graph colorings},
|
|
journal = {Journal of Combinatorial Theory},
|
|
volume = 1,
|
|
number = 1,
|
|
pages = {15-50},
|
|
year = 1966,
|
|
issn = {0021-9800},
|
|
doi = {10.1016/S0021-9800(66)80004-2},
|
|
url =
|
|
{https://www.sciencedirect.com/science/article/pii/S0021980066800042},
|
|
author = {W.T. Tutte},
|
|
}
|
|
|
|
@book{tutte1971,
|
|
place = {New York, NY},
|
|
title = {Introduction to the theory of Matroids},
|
|
publisher = {American Elsevier},
|
|
author = {Tutte, William Thomas},
|
|
year = 1971
|
|
}
|
|
|
|
@misc{vondrakjan2014,
|
|
author = {Vondr\'ak Jan},
|
|
title = {Submodularity and curvature: the optimal algorithm},
|
|
url =
|
|
{https://theory.stanford.edu/~jvondrak/data/submod-curv.pdf},
|
|
year = 2014,
|
|
}
|
|
|
|
@misc{vondrakjan2020,
|
|
author = {Ashwinkumar Badanidiyuru and Amin Karbasi and Ehsan
|
|
Kazemi and Jan Vondr\'ak},
|
|
title = {Submodular Maximization Through Barrier Functions},
|
|
year = 2020,
|
|
eprint = {arXiv:2002.03523},
|
|
}
|
|
|
|
@article{whitney1935,
|
|
title = {On the abstract properties of linear dependence},
|
|
volume = 57,
|
|
DOI = {10.2307/2371182},
|
|
number = 3,
|
|
journal = {American Journal of Mathematics},
|
|
author = {Whitney, Hassler},
|
|
year = 1935,
|
|
pages = 509
|
|
}
|
|
|
|
@article{wolsey1982,
|
|
title = {An analysis of the greedy algorithm for the
|
|
submodular set covering problem},
|
|
volume = 2,
|
|
doi = {10.1007/bf02579435},
|
|
number = 4,
|
|
journal = {Combinatorica},
|
|
author = {Wolsey, L. A.},
|
|
year = 1982,
|
|
pages = {385-393}
|
|
}
|
|
|
|
@book{ziegler2007,
|
|
title = {Lectures on Polytopes},
|
|
publisher = {Springer},
|
|
author = {Ziegler G{\" u}nter M.},
|
|
year = 2007
|
|
}
|