×

Found 7 Documents (Results 1–7)

Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks. (English) Zbl 07666350

Wu, Weili (ed.) et al., Combinatorial optimization and applications. 14th international conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12577, 198-213 (2020).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks. (English) Zbl 07561368

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 14, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Multiple sink location problems in dynamic path networks. (English) Zbl 1445.68109

Gu, Qianping (ed.) et al., Algorithmic aspects in information and management. 10th international conference, AAIM 2014, Vancouver, BC, Canada, July 8–11, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8546, 149-161 (2014).
MSC:  68Q25 90B10 90C35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimax regret 1-sink location problems in dynamic path networks. (English) Zbl 1302.90101

Chan, T-H. Hubert (ed.) et al., Theory and applications of models of computation. 10th international conference, TAMC 2013, Hong Kong, China, May 20–22, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38235-2/pbk). Lecture Notes in Computer Science 7876, 121-132 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field