Show simple item record

dc.contributor.authorHartline, Jeffen_US
dc.contributor.authorSharp, Alexaen_US
dc.date.accessioned2007-04-04T19:37:44Z
dc.date.available2007-04-04T19:37:44Z
dc.date.issued2004-09-29en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2004-1965en_US
dc.identifier.urihttps://hdl.handle.net/1813/5665
dc.description.abstractThis paper defines a hierarchical version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that build on each other incrementally. Thus far, hierarchical problems considered in the literature have been built on NP-complete problems. To the best of our knowledge, our results are the first to find a polynomial time problem whose hierarchical version is NP-complete. We present approximation algorithms and hardness results for many versions of this problem, and comment on the relation to multicommodity flow.en_US
dc.format.extent2375351 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleHierarchical Flowen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics