Pages that link to "Item:Q3888842"
From MaRDI portal
The following pages link to Worst case analysis of greedy type algorithms for independence systems (Q3888842):
Displaying 15 items.
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (Q1097893) (← links)
- An analysis of the greedy algorithm for partially ordered sets (Q1161533) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- Paroid search: Generic local combinatorial optimization (Q1801678) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- Two-way greedy: algorithms for imperfect rationality (Q2152097) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Matroidal approximations of independence systems (Q2661525) (← links)
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems (Q3703589) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Robust Randomized Matchings (Q5219560) (← links)