{"title": "How to split a flow?", "fields": ["shortest path problem", "greedy algorithm", "minimum cost flow problem", "flow network", "multi commodity flow problem"], "abstract": "Many practically deployed flow algorithms produce the output as a set of values associated with the network links. However, to actually deploy a flow in a network we often need to represent it as a set of paths between the source and destination nodes.", "citation": "Citations (23)", "departments": ["Google", "Google", "Google", "Google", "Google"], "authors": ["<NAME>.....http://dblp.org/pers/hd/h/Hartman:Tzvika", "<NAME>.....http://dblp.org/pers/hd/h/Hassidim:Avinatan", "<NAME>.....http://dblp.org/pers/hd/k/Kaplan:Haim", "<NAME>.....http://dblp.org/pers/hd/r/Raz:Danny", "<NAME>.....http://dblp.org/pers/hd/s/Segalov:Michal"], "conf": "infocom", "year": "2012", "pages": 9}