The following pages link to (Q4731220):
Displaying 8 items.
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs (Q612969) (← links)
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
- On the existence of weak greedy matching heuristics (Q1080871) (← links)
- An exact performance bound for an \(O(m+n)\) time greedy matching procedure (Q1378525) (← links)
- Matching problems in selective assembly operations (Q1383124) (← links)
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (Q1652405) (← links)
- Worst-case greedy matchings in the unitd-cube (Q3204344) (← links)
- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems (Q5443521) (← links)