Pages that link to "Item:Q834580"
From MaRDI portal
The following pages link to Models of greedy algorithms for graph problems (Q834580):
Displaying 13 items.
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- (Q5090377) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)