Gabow Harold N.

Harold N. Gabow

Information about the author Harold N. Gabow will soon be added to the site.
Found 2 papers in total
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
1998
In a digraph with real-valued edge capacities, we pack the greatest number of...
An efficient approximation algorithm for the survivable network design problem
An efficient approximation algorithm for the survivable network design problem
1998
The survivable network design problem is to construct a minimum-cost subgraph...
Papers per page: