Shortest path tree

Results: 178



#Item
1LNCSEfficient Dynamic Aggregation

LNCSEfficient Dynamic Aggregation

Add to Reading List

Source URL: webee.technion.ac.il

Language: English - Date: 2007-05-14 09:17:03
2Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗   arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

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

Add to Reading List

Source URL: www.dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:56
3A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar

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

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-03-26 07:24:20
4Algorithms 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

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

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2012-04-20 08:45:09
5A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†

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

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:36
6Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:39
7CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-10 00:55:12
8Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
9Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2005-11-30 21:17:11
10Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:11