Search Sciweavers | Sciweavers

7015 search results - page 90 / 1403

» Approximation algorithms for co-clustering

click to vote

TCS
2008

152views Theoretical Computer Science» more TCS 2008»

Approximation algorithms for partially covering with edges

13 years 9 months ago

Download www.mathcs.emory.edu

The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...

Ojas Parekh

claim paper

Read More »

click to vote

STOC
2005
ACM

81views Algorithms» more STOC 2005»

Improved approximation algorithms for minimum-weight vertex separators

14 years 9 months ago

Download www.cs.washington.edu

Uriel Feige, Mohammad Taghi Hajiaghayi, James R. L...

claim paper

Read More »

click to vote

SODA
1998
ACM

68views Algorithms» more SODA 1998»

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

13 years 10 months ago

Download www2.isye.gatech.edu

Martin W. P. Savelsbergh, R. N. Uma, Joel Wein

claim paper

Read More »

click to vote

SODA
1994
ACM

85views Algorithms» more SODA 1994»

An Optimal Algorithm for Approximate Nearest Neighbor Searching

13 years 10 months ago

Download orion.math.iastate.edu

Sunil Arya, David M. Mount, Nathan S. Netanyahu, R...

claim paper

Read More »

click to vote

COCOON
2007
Springer

79views Combinatorics» more COCOON 2007»

Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats

14 years 3 months ago

Download rnc.r.dendai.ac.jp

Tandem repeated regions are closely related to some genetic diseases in human beings. Once a region containing pseudo-periodic repeats is found, it is interesting to study the his...

Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen

claim paper

Read More »

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers