FOCS 1996 | Sciweavers

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...

Yuval Rabani

claim paper

Read More »

27

click to vote

FOCS
1996
IEEE

83views Theoretical Computer Science» more FOCS 1996»

Sampling According to the Multivariate Normal Density

14 years 4 months ago

Download research.microsoft.com

Ravi Kannan, Guangxing Li

claim paper

Read More »

28

click to vote

FOCS
1996
IEEE

68views Theoretical Computer Science» more FOCS 1996»

Property Testing and Its Connection to Learning and Approximation

14 years 4 months ago

Download www.eng.tau.ac.il

Oded Goldreich, Shafi Goldwasser, Dana Ron

claim paper

Read More »

36

click to vote

FOCS
1996
IEEE

111views Theoretical Computer Science» more FOCS 1996»

A 3-Approximation for the Minimum Tree Spanning k Vertices

14 years 4 months ago

Download www.carlyerger.com

In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...

Naveen Garg

claim paper

Read More »

31

click to vote

FOCS
1996
IEEE

89views Theoretical Computer Science» more FOCS 1996»

Learning Linear Transformations

14 years 4 months ago

Download www.math.cmu.edu

Alan M. Frieze, Mark Jerrum, Ravi Kannan

claim paper