Search Sciweavers | Sciweavers

7015 search results - page 145 / 1403

» Approximation algorithms for co-clustering

click to vote

SIGCOMM
2006
ACM

135views Communications» more SIGCOMM 2006»

Beyond bloom filters: from approximate membership checks to approximate state machines

14 years 3 months ago

Download theory.stanford.edu

Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of ﬂows simultaneously. We consider the question ...

Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...

claim paper

Read More »

click to vote

AAIM
2010
Springer

219views Algorithms» more AAIM 2010»

Approximating Maximum Edge 2-Coloring in Simple Graphs

14 years 19 days ago

Download rnc.r.dendai.ac.jp

We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...

Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita

claim paper

Read More »

click to vote

DAM
1999

169views more DAM 1999»

Approximating the Weight of Shallow Steiner Trees

13 years 9 months ago

Download crab.rutgers.edu

This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...

Guy Kortsarz, David Peleg

claim paper

Read More »

click to vote

STOC
2005
ACM

89views Algorithms» more STOC 2005»

Universal approximations for TSP, Steiner tree, and set cover

14 years 9 months ago

Download www.ccs.neu.edu

Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...

claim paper

Read More »