Lexicographic Flow
| dc.contributor.author | Kozen, Dexter | |
| dc.date.accessioned | 2009-06-25T20:30:27Z | |
| dc.date.available | 2009-06-25T20:30:27Z | |
| dc.date.issued | 2009-06-25T20:30:27Z | |
| dc.description.abstract | The lexicographic flow problem is a flow problem in which the edges are assigned priorities, and we wish to find a flow that is lexicographically maximum with respect to the priority assignment. The problem is reducible to a weighted flow problem, but we show that exponentially large weights are necessary in general. We then give an efficient direct algorithm that does not use weights. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/13018 | |
| dc.language.iso | en_US | en_US |
| dc.subject | flow | en_US |
| dc.title | Lexicographic Flow | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1