<--- Back to Details
First PageDocument Content
Artificial intelligence / Discrete geometry / Routing algorithms / Combinatorial optimization / Network theory / Voronoi diagram / Shortest path problem / A* search algorithm / Shortest path tree / Mathematics / Information science / Search algorithms
Date: 2011-01-17 05:16:04
Artificial intelligence
Discrete geometry
Routing algorithms
Combinatorial optimization
Network theory
Voronoi diagram
Shortest path problem
A* search algorithm
Shortest path tree
Mathematics
Information science
Search algorithms

chart_sf_r_rho_traversal.eps

Add to Reading List

Source URL: www.ruizhang.info

Download Document from Source Website

File Size: 1.002,03 KB

Share Document on Facebook

Similar Documents

Graph theory / Mathematics / Computational complexity theory / Edsger W. Dijkstra / Network theory / Shortest path problem / Minimum spanning tree / Network flow / Dynamic programming

LNCSEfficient Dynamic Aggregation

DocID: 1rjoH - View Document

Graph theory / Mathematics / Network theory / Routing algorithms / Edsger W. Dijkstra / Spanning tree / Bipartite graphs / Shortest path problem / Tree / Graph / Geographic routing / Routing

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

DocID: 1rg13 - View Document

Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Vertex cover / Steiner tree problem / Shortest path problem / Linear programming / Edge disjoint shortest pair algorithm / Minimum bottleneck spanning tree

A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar

DocID: 1r7hn - View Document

Graph theory / Mathematics / Discrete mathematics / Graph / Shortest path problem / Tree / Hamiltonian path / Connectivity / Directed graph / Ear decomposition / Cycle / Distance

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-na

DocID: 1qSPm - View Document

Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / Edsger W. Dijkstra / Spanning tree / Operations research / Shortest path problem / Graph / Linear programming / Steiner tree problem

A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†

DocID: 1qObK - View Document