Packet 4: Bonus 15

A 2025 result from Duan et al. claims to have disproven the conjectured optimality of this algorithm. For 10 points each:
[10m] Name this algorithm that maintains and updates a set of “frontier” elements in a priority queue. This algorithm is extended by an algorithm that additionally filters elements using an admissible heuristic function.
ANSWER: Dijkstra’s algorithm (The extension is A*.)
[10e] Dijkstra’s algorithm accomplishes this task on non-negative edge-weight graphs.
ANSWER: shortest path finding [or shortest path; accept descriptions of finding the shortest path between two nodes or vertices of a graph]
[10h] This algorithm extends Dijkstra’s algorithm to negative edge weights by reweighting each edge to make them all positive, using the Bellman–Ford algorithm to find paths, undoing the reweighting, and then running Dijkstra’s algorithm.
ANSWER: Johnson’s algorithm
<SL, Other Science (Computer Science)> | NAFTA-Packet-4

HeardPPBE %M %H %
3714.0597%43%0%

Back to bonuses

Conversion

TeamOpponentPart 1Part 2Part 3TotalParts
Berkeley ATeam 71010020ME
Stanford AConstans Constantius and Constantine Jr.1010020ME
Stanford BNot Old! (Old)1010020ME
Team 8Berkeley B010010E

Summary

TournamentEditionMatchHeardPPBE %M %H %
2026 NAFTA at Stanford01/17/2026417.50100%75%0%
2026 NAFTA at UBC01/17/2026215.00100%50%0%
2026 NAFTA at Vanderbilt02/14/2026313.33100%33%0%
2025 NAFTA at Toronto09/13/2025415.00100%50%0%
2025 NAFTA at Maryland09/27/2025412.5075%50%0%
2025 NAFTA at Harvard10/04/2025313.33100%33%0%
2025 NAFTA at Oxford10/11/2025412.50100%25%0%
2025 NAFTA at Chicago11/08/2025611.67100%17%0%
2025 NAFTA at Columbia11/08/2025516.00100%60%0%
2025 NAFTA at Richmond12/20/2025215.00100%50%0%