Fast algorithms for parametric scheduling come from extensions to parametric maximum flow

  • Authors:
  • S. Thomas McCormick

  • Affiliations:
  • Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC V6T 1Z2 Canada

  • Venue:
  • STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract