File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On the Langberg–Médard multiple unicast conjecture

TitleOn the Langberg–Médard multiple unicast conjecture
Authors
Issue Date2017
PublisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1382-6905
Citation
Journal of Combinatorial Optimization, 2017, v. 34 n. 4, p. 1114-1132 How to Cite?
AbstractA version of the multiple unicast conjecture, proposed by Langberg and Médard (in: Proceedings of 47th annual Allerton, 2009), says that, there exists an undirected fractional multi-commodity flow, or simply, multi-flow, with rate (1,1,…,1) for strongly reachable networks. In this paper, we propose a nonsmooth matrix optimization problem to attack this conjecture: By giving upper and lower bounds on the objective value, we prove that there exists a multi-flow with rate at least (8/9,8/9,…,8/9) for such networks; on the other hand though, we show that the rate of any multi-flow constructed using this framework cannot exceed (1,1,…,1).
Persistent Identifierhttp://hdl.handle.net/10722/245055
ISSN
2015 Impact Factor: 1.08
2015 SCImago Journal Rankings: 1.093

 

DC FieldValueLanguage
dc.contributor.authorCai, K-
dc.contributor.authorHan, G-
dc.date.accessioned2017-09-18T02:03:49Z-
dc.date.available2017-09-18T02:03:49Z-
dc.date.issued2017-
dc.identifier.citationJournal of Combinatorial Optimization, 2017, v. 34 n. 4, p. 1114-1132-
dc.identifier.issn1382-6905-
dc.identifier.urihttp://hdl.handle.net/10722/245055-
dc.description.abstractA version of the multiple unicast conjecture, proposed by Langberg and Médard (in: Proceedings of 47th annual Allerton, 2009), says that, there exists an undirected fractional multi-commodity flow, or simply, multi-flow, with rate (1,1,…,1) for strongly reachable networks. In this paper, we propose a nonsmooth matrix optimization problem to attack this conjecture: By giving upper and lower bounds on the objective value, we prove that there exists a multi-flow with rate at least (8/9,8/9,…,8/9) for such networks; on the other hand though, we show that the rate of any multi-flow constructed using this framework cannot exceed (1,1,…,1).-
dc.languageeng-
dc.publisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1382-6905-
dc.relation.ispartofJournal of Combinatorial Optimization-
dc.rightsThe final publication is available at Springer via http://dx.doi.org/[insert DOI]-
dc.titleOn the Langberg–Médard multiple unicast conjecture-
dc.typeArticle-
dc.identifier.emailCai, K: kcai@hku.hk-
dc.identifier.emailHan, G: ghan@hku.hk-
dc.identifier.authorityHan, G=rp00702-
dc.identifier.doi10.1007/s10878-017-0132-2-
dc.identifier.hkuros277982-
dc.identifier.volume34-
dc.identifier.issue4-
dc.identifier.spage1114-
dc.identifier.epage1132-
dc.publisher.placeNetherlands-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats