Efficient algorithms for a family of matroid intersection problems

Recommendations

Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
On-line updating of solutions to a class of matroid intersection problems
Efficient theoretic and practical algorithms for linear matroid intersection problems
scientific article; zbMATH DE number 1555984
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs

Cited in

(52)

An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
Eine Min-Max Beziehung für das Exakte Matroid Problem. (A min-max relation for the exact matroid problem)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
An augmenting path algorithm for linear matroid parity
On-line updating of solutions to a class of matroid intersection problems
Exact arborescences, matchings and cycles
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
A Lagrangean approach to the degree-constrained minimum spanning tree problem
Color constrained combinatorial optimization problems
Steiner trees with n terminals among n+1 nodes
An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
The vertex degrees of minimum spanning trees
Optimization problems with color-induced budget constraints
Preprocessing and cut generation techniques for multi-objective binary programming
A multiply constrained matroid optimization problem
A data structure for dynamic trees
Matroid optimization with generalized constraints
An exact algorithm for the capacitated shortest spanning arborescence
Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems
Efficient solution of the matroid product problem
Approximating the least core value and least core of cooperative games with supermodular costs
Optimization problems with color-induced budget constraints
Improved algorithms for joint optimization of facility locations and network connections
Semi–preemptive routing on a line
scientific article; zbMATH DE number 3904590 (Why is no real title available?)
scientific article; zbMATH DE number 3970767 (Why is no real title available?)
scientific article; zbMATH DE number 4068895 (Why is no real title available?)
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
scientific article; zbMATH DE number 26304 (Why is no real title available?)
scientific article; zbMATH DE number 2040948 (Why is no real title available?)
scientific article; zbMATH DE number 1555984 (Why is no real title available?)
Generalized multiple objective bottleneck problems
A Fast Approximation for Maximum Weight Matroid Intersection
Small degree out‐branchings
On the generality of the greedy algorithm for solving matroid base problems
Bicolored matchings in some classes of graphs
Multi-objective matroid optimization with ordinal weights
Min‐sum controllable risk problems with concave risk functions of the same value range
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
Biobjective optimization problems on matroids with binary costs
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
Color-constrained arborescences in edge-colored digraphs
Arborescences and shortest path trees when colors matter
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Steepest descent algorithm for M-convex function minimization using long step length
Efficient algorithms for robustness in resource allocation and scheduling problems
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
Semi-preemptive routing on a linear and circular track
Probabilistic single processor scheduling

This page was built for publication: Efficient algorithms for a family of matroid intersection problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335803)