Kaplan H.

H. Kaplan

Information about the author H. Kaplan will soon be added to the site.
Found 2 papers in total
Caching documents with variable sizes and fetching costs: An LP-based approach
2002
We give an integer programming formulation of the paging problem with varying sizes...
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
2002
We present a randomized procedure for rounding fractional perfect matchings to...
Papers per page: