Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Ronald L. Rivest and Sivan Toledo Fall 2008 Handout 12

First Page		Document Content
Date: 2008-11-10 01:44:04 Search algorithms Sorting algorithms Network theory Shortest path problem Routing algorithms Breadth-first search Topological sorting Bellman–Ford algorithm Depth-first search Mathematics Graph theory Theoretical computer science		Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Ronald L. Rivest and Sivan Toledo Fall 2008 Handout 12 Add to Reading List Source URL: courses.csail.mit.edu Download Document from Source Website File Size: 68,41 KB Share Document on Facebook

	VEHICLE ROUTING ALGORITHMS FOR RADIALLY ESCAPING TARGETS PUSHKARINI AGHARKAR †, DocID: 1vkvr - View Document
	T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing DocID: 1uOB1 - View Document
	Improving Non-Minimal and Adaptive Routing Algorithms in Slim Fly Networks Pedro Y´ebenes∗ , Jesus Escudero-Sahuquillo∗ , Pedro J. Garc´ıa∗ , Francisco J. Quiles∗ , and Torsten Hoefler† ∗ Department of Co DocID: 1tVFZ - View Document
	Trust-based Anonymous Communication: Adversary Models and Routing Algorithms ∗ Aaron Johnson DocID: 1tMc3 - View Document
	1 Distributed routing algorithms to manage power flow in agent-based active distribution network Phuong H. Nguyen, Wil L. Kling, Member, IEEE, Giorgos Georgiadis, Marina Papatriantafilou, Le Anh Tuan, Member IEEE, Lina DocID: 1sdUe - View Document