Hall Alexander

Alexander Hall

Information about the author Alexander Hall will soon be added to the site.
Found 2 papers in total
A fully polynomial time approximation scheme for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
2007
Given a network with capacities and transit times on the arcs, the quickest flow...
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
2004
We consider the version of broadcast scheduling where a server can transmit W messages...
Papers per page: