Sciweavers

7015 search results - page 164 / 1403

» Approximation algorithms for co-clustering

86

ISAAC
2007
Springer

95views Algorithms» more ISAAC 2007»

Hardness and Approximation of Traffic Grooming

15 years 9 months ago

Hardness and Approximation of Traffic Grooming

Download www.cs.technion.ac.il

Omid Amini, Stéphane Pérennes, Ignas...

claim paper

Read More »

86

COCO
2005
Springer

68views Algorithms» more COCO 2005»

Pseudorandomness for Approximate Counting and Sampling

15 years 9 months ago

Pseudorandomness for Approximate Counting and Sampling

Download www.cs.caltech.edu

Ronen Shaltiel, Christopher Umans

claim paper

Read More »

98

ISAAC
2005
Springer

100views Algorithms» more ISAAC 2005»

Hardness and Approximation of Octilinear Steiner Trees

15 years 8 months ago

Hardness and Approximation of Octilinear Steiner Trees

Download www.zaik.uni-koeln.de

Matthias Müller-Hannemann, Anna Schulze

claim paper

Read More »

114

WAOA
2005
Springer

90views Algorithms» more WAOA 2005»

Approximation Schemes for Packing with Item Fragmentation

15 years 8 months ago

Approximation Schemes for Packing with Item Fragmentation

Download www.cs.technion.ac.il

Hadas Shachnai, Tami Tamir, Omer Yehezkely

claim paper

Read More »

85

Voted

ESA
2004
Springer

119views Algorithms» more ESA 2004»

Approximate Parameterized Matching

15 years 8 months ago

Approximate Parameterized Matching

Download u.cs.biu.ac.il

Carmit Hazay, Moshe Lewenstein, Dina Sokol

claim paper

Read More »

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