The following pages link to Matroids and the greedy algorithm (Q5668601):
Displaying 50 items.
- Extended formulations for sparsity matroids (Q304267) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Characterizing and recognizing generalized polymatroids (Q403645) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- Covering cycle matroid (Q469837) (← links)
- Greedy algorithms and poset matroids (Q473210) (← links)
- Graph and matrix approaches to rough sets through matroids (Q508728) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Matroid base polytope decomposition (Q544143) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Bases axioms and circuits axioms for fuzzifying matroids (Q622079) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- Bases-cobases graphs and polytopes of matroids (Q684402) (← links)
- Stable sets versus independent sets (Q686148) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Duality between quasi-concave functions and monotone linkage functions (Q712240) (← links)
- A simple greedy algorithm for a class of shuttle transportation problems (Q732773) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- The nestedness property of the convex ordered median location problem on a tree (Q783030) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- On the number of common bases of two matroids (Q794657) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- A note on matchings and separability (Q802467) (← links)
- Path-closed sets (Q802569) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
- Job distribution algorithms (Q885731) (← links)
- Nullity-based matroid of rough sets and its application to attribute reduction (Q903646) (← links)
- On the \(K\)th best base of a matroid (Q935236) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- A new algorithm for the intersection of a line with the independent set polytope of a matroid (Q1004529) (← links)
- A general model for matroids and the greedy algorithm (Q1013980) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
- The 2-quasi-greedy algorithm for cardinality constrained matroid bases (Q1079134) (← links)
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
