Characterization and algorithms for greedily solvable transportation problems

Authors:
Ron Shamir;Brenda Dietrich
Affiliations:
DIMACS Center, Rutgers University, Box 1179, Piscataway NJ and DIMACS Center and Tel Aviv University;IBM Watson Research Center, Box 218, Yorktown Heights, NY
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 2
Cited 2

A circuit set characterization of antimatroids

Journal of Combinatorial Theory Series A
A faster strongly polynomial minimum cost flow algorithm

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

A fast bipartite network flow algorithm for selective assembly

Operations Research Letters
When does greedy learning of relevant attributes succeed?: a fourier-based characterization

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract