<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-12-28 09:03:00Routing algorithms Network theory Search algorithms Matching Shortest path problem Bellman–Ford algorithm Shortest path tree Path Tree Graph theory Mathematics Theoretical computer science |
| LNCSEfficient Dynamic AggregationDocID: 1rjoH - View Document |
| Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011DocID: 1rg13 - View Document |
| A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit KumarDocID: 1r7hn - View Document |
| Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-naDocID: 1qSPm - View Document |
| A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†DocID: 1qObK - View Document |