Pages that link to "Item:Q1116893"
From MaRDI portal
The following pages link to A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893):
Displayed 14 items.
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Color constrained combinatorial optimization problems (Q1178732) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
- The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
- Two algorithms for weighted matroid intersection (Q3770280) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- An Approximation Algorithm for the Three Depots Hamiltonian Path Problem (Q4596182) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- Biobjective optimization problems on matroids with binary costs (Q6132760) (← links)