Sciweavers

FOCS
1996
IEEE
14 years 3 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
FOCS
1996
IEEE
14 years 3 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
14 years 3 months ago
Learning Linear Transformations
Alan M. Frieze, Mark Jerrum, Ravi Kannan
FOCS
1996
IEEE
14 years 3 months ago
The Optimal Path-Matching Problem
William H. Cunningham, James F. Geelen
FOCS
1996
IEEE
14 years 3 months ago
Approximate Option Pricing
Prasad Chalasani, Somesh Jha, Isaac Saias
FOCS
1996
IEEE
14 years 3 months ago
A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh V...