Sciweavers

169 search results - page 1 / 34
» Distributed Approximation Algorithms for Finding 2-Edge-Conn...
Sort
View
OPODIS
2007
13 years 8 months ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
13 years 8 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
FSTTCS
2010
Springer
13 years 3 months ago
Finding Sparser Directed Spanners
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
Piotr Berman, Sofya Raskhodnikova, Ge Ruan
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 4 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
CSE
2008
IEEE
13 years 8 months ago
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
Subhas Kumar Ghosh