Yuster Raphael

Raphael Yuster

Information about the author Raphael Yuster will soon be added to the site.
Found 5 papers in total
Maximum Matching in Regular and Almost Regular Graphs
Maximum Matching in Regular and Almost Regular Graphs
2013
We present an O ( n 2 log n )‐time algorithm that finds a maximum matching in a...
Almost Exact Matchings
Almost Exact Matchings
2012
In the exact matching problem we are given a graph G , some of whose edges are colored...
Hardness and algorithms for rainbow connection
Hardness and algorithms for rainbow connection
2011
An edge‐colored graph G is rainbow connected if any two vertices are connected...
All‐Pairs Bottleneck Paths in Vertex Weighted Graphs
All‐Pairs Bottleneck Paths in Vertex Weighted Graphs
2011
Let G =( V , E , w ) be a directed graph, where w : V →ℝ is a weight...
A (1−1/e)-approximation algorithm for the generalized assignment problem
A (1−1/e)-approximation algorithm for the generalized assignment problem
2006
We give a (1− 1/ e )-approximation algorithm for the max-profit generalized...
Papers per page: