Pages that link to "Item:Q3323971"
From MaRDI portal
The following pages link to Greedoids and Linear Objective Functions (Q3323971):
Displaying 14 items.
- Randomized priority algorithms (Q974749) (← links)
- Greedoid polyhedra (Q1097283) (← links)
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299) (← links)
- Branchings in rooted graphs and the diameter of greedoids (Q1118604) (← links)
- Greedoids and searches in directed graphs (Q1182876) (← links)
- Greedy algorithm compatibility and heavy-set structures (Q1193543) (← links)
- Exchange systems (Q1823954) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
- Sufficient conditions for the optimality of the greedy algorithm in greedoids (Q2168727) (← links)
- New polyhedral and algorithmic results on greedoids (Q2220660) (← links)
- Polymatroid greedoids (Q2266020) (← links)
- An algorithmic characterization of antimatroids (Q2640448) (← links)
- Problems on independence systems solvable by the greedy algorithm (Q3225892) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
