Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Neal E. Young
Information about the author Neal E. Young will soon be added to the site.
Found
2 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Incremental medians via online bidding
2008
In the k -median problem we are given sets of facilities and customers, and distances...
Rounding algorithms for a geometric embedding of minimum multiway cut
2004
Given an undirected graph with edge costs and a subset of k⩾3 nodes called...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
