×

Found 630 Documents (Results 1–100)

Newest Citations Relevance
Vasyanin, V. A.; Trofymchuk, O. M.; Ushakova, L. P.

Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints. (English. Ukrainian original) Zbl 1509.90039

Cybern. Syst. Anal. 58, No. 6, 966-976 (2022); translation from Kibern. Sist. Anal. 58, No. 6, 130-142 (2022).
MSC:  90B06 90B10 90C05 90C10
PDF BibTeX XML Cite
\textit{V. A. Vasyanin} et al., Cybern. Syst. Anal. 58, No. 6, 966--976 (2022; Zbl 1509.90039); translation from Kibern. Sist. Anal. 58, No. 6, 130--142 (2022)
Full Text: DOI
Malashenko, Y. E.; Nazarova, I. A.

Analysis of critical damage in the communication network. III: Analysis of internode flows. (English. Russian original) Zbl 1483.94005

J. Comput. Syst. Sci. Int. 60, No. 4, 576-584 (2021); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2021, No. 4, 74-83 (2021).
Reviewer: Józef Woźniak (Gdańsk)
MSC:  94A05 90B18 68M10 90B25 68M15 90C05 90C47
PDF BibTeX XML Cite
\textit{Y. E. Malashenko} and \textit{I. A. Nazarova}, J. Comput. Syst. Sci. Int. 60, No. 4, 576--584 (2021; Zbl 1483.94005); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2021, No. 4, 74--83 (2021)
Full Text: DOI
Kumar, Nikhil

Multicommodity flows in planar graphs with demands on faces. (English) Zbl 07765399

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 41, 11 p. (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{N. Kumar}, LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 41, 11 p. (2020; Zbl 07765399)
Full Text: DOI arXiv
Garg, Naveen; Kumar, Nikhil

Dual half-integrality for uncrossable cut cover and its application to maximum half-integral flow. (English) Zbl 07651194

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 55, 13 p. (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{N. Garg} and \textit{N. Kumar}, LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 55, 13 p. (2020; Zbl 07651194)
Full Text: DOI arXiv
Garg, Naveen; Kumar, Nikhil; Sebő, András

Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation. (English) Zbl 1503.90147

Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 21st international conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12125, 144-157 (2020).
MSC:  90C35 90C59
PDF BibTeX XML Cite
\textit{N. Garg} et al., Lect. Notes Comput. Sci. 12125, 144--157 (2020; Zbl 1503.90147)
Full Text: DOI arXiv
Malashenko, Yu. E.; Nazarova, I. A.; Novikova, N. M.

Analysis of cluster damages in network systems. (English. Russian original) Zbl 1479.90047

Comput. Math. Math. Phys. 60, No. 2, 341-351 (2020); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 2, 338-348 (2020).
MSC:  90B10 90B25
PDF BibTeX XML Cite
\textit{Yu. E. Malashenko} et al., Comput. Math. Math. Phys. 60, No. 2, 341--351 (2020; Zbl 1479.90047); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 2, 338--348 (2020)
Full Text: DOI
Ravi, R.; Rudenko, Oleksandr

Multicommodity multicast, wireless and fast. (English) Zbl 07525515

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 78, 20 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{R. Ravi} and \textit{O. Rudenko}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 78, 20 p. (2019; Zbl 07525515)
Full Text: DOI
Malashenko, Yu. E.; Nazarova, I. A.; Novikova, N. M.

Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system. (English. Russian original) Zbl 1448.93021

J. Comput. Syst. Sci. Int. 58, No. 6, 889-897 (2019); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2019, No. 6, 63-72 (2019).
MSC:  93B03 93B70
PDF BibTeX XML Cite
\textit{Yu. E. Malashenko} et al., J. Comput. Syst. Sci. Int. 58, No. 6, 889--897 (2019; Zbl 1448.93021); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2019, No. 6, 63--72 (2019)
Full Text: DOI
Malashenko, Yu. E.; Nazarova, I. A.; Novikova, N. M.

An approach to the analysis of possible structural damages in multicommodity network systems. (English. Russian original) Zbl 1453.90038

Comput. Math. Math. Phys. 59, No. 9, 1562-1574 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1626-1638 (2019).
MSC:  90B10 90C35 91A80
PDF BibTeX XML Cite
\textit{Yu. E. Malashenko} et al., Comput. Math. Math. Phys. 59, No. 9, 1562--1574 (2019; Zbl 1453.90038); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1626--1638 (2019)
Full Text: DOI
Salmasi, Ario; Sidiropoulos, Anastasios; Sridhar, Vijay

On constant multi-commodity flow-cut gaps for families of directed minor-free graphs. (English) Zbl 1434.05065

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 535-553 (2019).
MSC:  05C21 05C83 90B10
PDF BibTeX XML Cite
\textit{A. Salmasi} et al., in: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6--9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 535--553 (2019; Zbl 1434.05065)
Full Text: DOI arXiv
Pióro, Michał; Kalesnikau, Ilya; Poss, Michael

Path generation for affine flow thinning. (English) Zbl 1392.90046

Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 355-364 (2018).
MSC:  90B18 90C35 90C05 90C11
PDF BibTeX XML Cite
\textit{M. Pióro} et al., Electron. Notes Discrete Math. 64, 355--364 (2018; Zbl 1392.90046)
Full Text: DOI HAL
Grande, Enrico; Nicosia, Gaia; Pacifici, Andrea; Roselli, Vincenzo

An exact algorithm for a multicommodity min-cost flow over time problem. (English) Zbl 1392.90024

Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 125-134 (2018).
MSC:  90B10 90C35 90C05
PDF BibTeX XML Cite
\textit{E. Grande} et al., Electron. Notes Discrete Math. 64, 125--134 (2018; Zbl 1392.90024)
Full Text: DOI
Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel

Coding in undirected graphs is either very helpful or not helpful at all. (English) Zbl 1402.90030

Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 18, 18 p. (2017).
MSC:  90B18 05C21 05C76 94A29
PDF BibTeX XML Cite
\textit{M. Braverman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 18, 18 p. (2017; Zbl 1402.90030)
Full Text: DOI arXiv
Sherman, Jonah

Area-convexity, \(\ell_\infty\) regularization, and undirected multicommodity flow. (English) Zbl 1370.90050

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 452-460 (2017).
MSC:  90B10 05C21 15A45 15B51 65F22 68W25
PDF BibTeX XML Cite
\textit{J. Sherman}, in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 452--460 (2017; Zbl 1370.90050)
Full Text: DOI
Karakostas, George

Approximation schemes for fractional multicommodity flow problems. (English) Zbl 1393.90018

Thulasiraman, Krishnaiyan (ed.) et al., Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press (ISBN 978-1-58488-595-5/hbk; 978-1-4200-1107-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 1079-1095 (2016).
MSC:  90B10 90C59
PDF BibTeX XML Cite
\textit{G. Karakostas}, in: Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press. 1079--1095 (2016; Zbl 1393.90018)
Vaidyanathan, Balachandran; Ahuja, Ravindra K.; Orlin, James B.; Magnanti, Thomas L.

Multicommodity flows. (English) Zbl 1393.90022

Thulasiraman, Krishnaiyan (ed.) et al., Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press (ISBN 978-1-58488-595-5/hbk; 978-1-4200-1107-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 157-174 (2016).
MSC:  90B10
PDF BibTeX XML Cite
\textit{B. Vaidyanathan} et al., in: Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press. 157--174 (2016; Zbl 1393.90022)
Krishnaswamy, Ravishankar; Nagarajan, Viswanath; Pruhs, Kirk; Stein, Cliff

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. (English) Zbl 1315.68287

Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 734-743 (2014).
MSC:  68W25 68M10 90B10
PDF BibTeX XML Cite
\textit{R. Krishnaswamy} et al., in: Proceedings of the 46th annual ACM symposium on theory of computing, STOC '14, New York, NY, USA, May 31 -- June 3, 2014. New York, NY: Association for Computing Machinery (ACM). 734--743 (2014; Zbl 1315.68287)
Full Text: DOI arXiv
Trofimchyk, A. N.; Vasyanin, V. A.

A technique to solve packing problem for the management of perspective development of communication network nodes. (English. Russian original) Zbl 1308.90191

Cybern. Syst. Anal. 50, No. 4, 560-569 (2014); translation from Kibern. Sist. Anal. No. 4, 88-99 (2014).
MSC:  90C35 90B18
PDF BibTeX XML Cite
\textit{A. N. Trofimchyk} and \textit{V. A. Vasyanin}, Cybern. Syst. Anal. 50, No. 4, 560--569 (2014; Zbl 1308.90191); translation from Kibern. Sist. Anal. No. 4, 88--99 (2014)
Full Text: DOI
Girlich, E.; Kovalev, M. M.; Listopad, N. I.

Optimal choice of the capacities of telecommunication networks to provide QoS-routing. (English) Zbl 1303.90017

Dudin, Alexander (ed.) et al., Modern probabilistic methods for analysis of telecommunication networks. Proceedings on the Belarusian winter workshops in queueing theory, BWWQT 2013, Minsk, Belarus, January 28–31, 2013. Berlin: Springer (ISBN 978-3-642-35979-8/pbk; 978-3-642-35980-4/ebook). Communications in Computer and Information Science 356, 93-104 (2013).
MSC:  90B18
PDF BibTeX XML Cite
\textit{E. Girlich} et al., Commun. Comput. Inf. Sci. 356, 93--104 (2013; Zbl 1303.90017)
Full Text: DOI
Lee, James R.; Mendel, Manor; Moharrami, Mohammad

A node-capacitated Okamura-Seymour theorem. (English) Zbl 1293.05147

Proceedings of the 45th annual ACM symposium on theory of computing, STOC ’13. Palo Alto, CA, USA, June 1–4, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2029-0). 495-504 (2013).
MSC:  05C21 68Q25
PDF BibTeX XML Cite
\textit{J. R. Lee} et al., in: Proceedings of the 45th annual ACM symposium on theory of computing, STOC '13. Palo Alto, CA, USA, June 1--4, 2013. New York, NY: Association for Computing Machinery (ACM). 495--504 (2013; Zbl 1293.05147)
Full Text: DOI arXiv
Girlich, E.; Kovalev, M. M.; Listopad, N. I.

Optimal choice of the capacities of telecommunication networks to provide QoS-routing. (English) Zbl 1274.94001

Dudin, Alexander (ed.) et al., Modern probabilistic methods for analysis of telecommunication networks. Proceedings on the Belarusian winter workshops in queueing theory, BWWQT 2013, Minsk, Belarus, January 28–31, 2013. Berlin: Springer (ISBN 978-3-642-35979-8/pbk; 978-3-642-35980-4/ebook). Communications in Computer and Information Science 356, 93-104 (2013).
MSC:  94A05 90B18
PDF BibTeX XML Cite
\textit{E. Girlich} et al., Commun. Comput. Inf. Sci. 356, 93--104 (2013; Zbl 1274.94001)
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software