z

ref.bib

@@ -0,0 +1,32 @@
+
+@article{geelen_computing_2018,
+	title = {Computing {Girth} and {Cogirth} in {Perturbed} {Graphic} {Matroids}},
+	volume = {38},
+	issn = {0209-9683, 1439-6912},
+	url = {http://link.springer.com/10.1007/s00493-016-3445-3},
+	doi = {10.1007/s00493-016-3445-3},
+	language = {en},
+	number = {1},
+	urldate = {2023-03-02},
+	journal = {Combinatorica},
+	author = {Geelen, Jim and Kapadia, Rohan},
+	month = feb,
+	year = {2018},
+	pages = {167--191},
+	file = {s00493-016-3445-3 (1).pdf:/Users/congyu/Zotero/storage/EPZ6BTDE/s00493-016-3445-3 (1).pdf:application/pdf},
+}
+
+@article{nagele_submodular_2019,
+	title = {Submodular {Minimization} {Under} {Congruency} {Constraints}},
+	volume = {39},
+	issn = {1439-6912},
+	url = {https://doi.org/10.1007/s00493-019-3900-1},
+	doi = {10.1007/s00493-019-3900-1},
+	abstract = {Submodular function minimization (SFM) is a fundamental and efficiently solvable problem in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint types under which SFM remains efficiently solvable. The arguably most relevant non-trivial constraint class for which polynomial SFM algorithms are known are parity constraints, i.e., optimizing only over sets of odd (or even) cardinality. Parity constraints capture classical combinatorial optimization problems like the odd-cut problem, and they are a key tool in a recent technique to efficiently solve integer programs with a constraint matrix whose subdeterminants are bounded by two in absolute value.},
+	number = {6},
+	journal = {Combinatorica},
+	author = {Nägele, Martin and Sudakov, Benny and Zenklusen, Rico},
+	month = dec,
+	year = {2019},
+	pages = {1351--1386},
+}