Staff View
Approximate minimum-cost multicommodity flows in Õ(Ɛ-2KNM) time

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (6 pages)
Note (type = special display note)
Technical report LCSR-TR-245
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Approximate minimum-cost multicommodity flows in Õ(<sub>Ɛ</sub><sup>-2</sup>KNM) time
Subject (authority = local)
Topic
Approximation algorithm
Subject (authority = local)
Topic
Block-angular program
Subject (authority = local)
Topic
Minimum-cost multicommodity network flow
Subject (authority = local)
Topic
Structured optimization
Abstract (type = abstract)
We show that an $veps$-approximate solution of the cost-constrained $K$-commodity flow problem on an $N$-node $M$-arc network $G$ can be computed by sequentially solving $O(K(eps^{-2}+log K)log Mlog(eps^{-1}K))$ single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $ilde O(eps^{-2}KNM)$ running time, where the notation $ilde O(cdot)$ means ``up to logarithmic factors''. This result improves the time bound mentioned in Grigoriadis and Khachiyan (1994) by a factor of $M/N$ and that developed recently in Karger and Plotkin (1995) by a factor of $eps^{-1}$. We also provide a simple $ilde O(NM)$-time algorithm for single-commodity budget-constrained minimum-cost flows which is $ilde O(eps^{-3})$ times faster than the algorithm of Karger and Plotkin (1995).
Name (type = personal)
NamePart (type = family)
Grigoriadis
NamePart (type = given)
Michael D.
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Khachiyan
NamePart (type = given)
Leonid
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
1995-05
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-agzc-6w07
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
CreatingApplication
Version
1.4
ApplicationName
GPL Ghostscript 9.07
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:37:16
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:37:16
Back to the top
Version 8.3.10
Rutgers University Libraries - Copyright ©2019