Searching for "A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement
by Sanjeev Arora, Alan Frieze, Haim Kaplan — 2001
…A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement…
Cited by 49 (3 self) – Add To MetaCart

Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric
by Richard Mayr, Annette Schelten
…] S. Arora, A. Frieze, and H. Kaplan. A new rounding procedure for the assignment problem…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB