Sciweavers

7015 search results - page 134 / 1403

» Approximation algorithms for co-clustering

26

WAW
2009
Springer

129views Algorithms» more WAW 2009»

Approximating the Number of Network Motifs

14 years 3 months ago

Approximating the Number of Network Motifs

Download www.eng.tau.ac.il

Mira Gonen, Yuval Shavitt

claim paper

Read More »

24

ISAAC
2009
Springer

98views Algorithms» more ISAAC 2009»

Complexity of Approximating the Vertex Centroid of a Polyhedron

14 years 3 months ago

Complexity of Approximating the Vertex Centroid of a Polyhedron

Download www.mpi-inf.mpg.de

Khaled M. Elbassioni, Hans Raj Tiwary

claim paper

Read More »

25

AAIM
2007
Springer

127views Algorithms» more AAIM 2007»

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

14 years 3 months ago

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

Download www.lab2.kuis.kyoto-u.ac.jp

Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas

claim paper

Read More »

18

APPROX
2007
Springer

95views Algorithms» more APPROX 2007»

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

14 years 3 months ago

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

Download research.microsoft.com

Uriel Feige, Mohit Singh

claim paper

Read More »

31

ESCAPE
2007
Springer

256views Algorithms» more ESCAPE 2007»

A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection

14 years 3 months ago

A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection

Download www.dii.uchile.cl

Wolfgang W. Bein, José R. Correa, Xin Han

claim paper

Read More »

« Prev « First page 134 / 1403 Last » Next »