The Magic Of Monotone Integer Programs: Polynomial Time Solvability With Min-Cut Procedure, Fast High Quality Solutions for Related Hard Problems and the New Incremental Parametric Cut Algorithm For Densest Subgraph and Other Monotone Ratio Problems

Princeton Optimization Seminar

Dorit Hochbaum, University of California, Berkeley

December 12

4:30 pm

Sherrerd Hall, 101

See event website for additional details and how to view or participate.

Sponsors

Sherrerd Hall

Operations Research and Financial Engineering

Developing mathematical and computational tools for making decisions under uncertainty