Kevin D. Wayne

According to our database, Kevin D. Wayne authored at least 5 papers between 1998 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

Fast and simple approximation schemes for generalized flow.

Lisa Fleischer, Kevin D. Wayne

Math. Program., 2002

1999

A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow.

Kevin D. Wayne

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Faster Approximation Algorithms for Generalized Flow.

Kevin D. Wayne, Lisa Fleischer

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A New Property and a Faster Algorithm for Baseball Elimination.

Kevin D. Wayne

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Simple Generalized Maximum Flow Algorithms.

Éva Tardos, Kevin D. Wayne

Proceedings of the Integer Programming and Combinatorial Optimization, 1998