Sciweavers

FOCS
1996
IEEE
15 years 11 months ago
Path Coloring on the Mesh
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
142
Voted
FOCS
1996
IEEE
15 years 11 months ago
Property Testing and Its Connection to Learning and Approximation
Oded Goldreich, Shafi Goldwasser, Dana Ron
149
Voted
FOCS
1996
IEEE
15 years 11 months ago
A 3-Approximation for the Minimum Tree Spanning k Vertices
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
FOCS
1996
IEEE
15 years 11 months ago
Learning Linear Transformations
Alan M. Frieze, Mark Jerrum, Ravi Kannan
141
Voted
FOCS
1996
IEEE
15 years 11 months ago
The Optimal Path-Matching Problem
William H. Cunningham, James F. Geelen
FOCS
1996
IEEE
15 years 11 months ago
Approximate Option Pricing
Prasad Chalasani, Somesh Jha, Isaac Saias