@inproceedings{STOC-1998-KargerL,
	author        = "David R. Karger and Matthew S. Levine",
	booktitle     = "{Proceedings of the 30th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/276698.276714",
	isbn          = "0-89791-962-9",
	pages         = "69--78",
	publisher     = "{ACM}",
	title         = "{Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching}",
	year          = 1998,
}