Decomposable multi-parameter matroid optimization problems (original) (raw)
Related papers
On the generality of the greedy algorithm for solving matroid base problems
Discrete Applied Mathematics, 2014
SIAM Journal on Discrete Mathematics, 2003
Branch Decomposition Heuristics for Linear Matroids
Manuscript in preparation
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
Mathematical Programming, 2010
Decomposition and optimization over cycles in binary matroids
Journal of Combinatorial Theory, Series B, 1989
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
Theoretical Computer Science, 1997
Matroid Secretary Problem in the Random Assignment Model
2010
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
Discrete Applied Mathematics, 1986
Using sparsification for parametric minimum spanning tree problems
Lecture Notes in Computer Science, 1996
A general model for matroids and the greedy algorithm
Mathematical Programming, 2008
On the Connection of Matroids and Greedy Algorithms
IJEER, 2022
The capacitated minimum spanning tree problem
Tdx, 2013
Reoptimization of the minimum spanning tree
Wiley Interdisciplinary Reviews: Computational Statistics, 2011
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms, 2010
A note on packing spanning trees in graphs and bases in matroids
Cornell University - arXiv, 2012
A new exchange property for matroids and its application to max-min-problems
Zeitschrift für Operations Research, 1984
Matroid Secretary for Regular and Decomposable Matroids
SIAM Journal on Computing, 2014
Lecture Notes in Computer Science, 2014
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint
ArXiv, 2019
A constrained independent set problem for matroids
Operations Research Letters, 2004
Nonlinear optimization for matroid intersection and extensions
2008
Submodular maximization with matroid and packing constraints in parallel
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
The base-matroid and inverse combinatorial optimization problems
Federico Malucelli, Mauro Dell'Amico
Discrete Applied Mathematics, 2003
On the Kth Best Base of a Matroid
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
Networks, 2004
Most and least uniform spanning trees
Discrete Applied Mathematics, 1986
2006
Improved Competitive Ratio for the Matroid Secretary Problem
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
iiisci.org