Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation

DOI10.1016/J.TCS.2023.114353OpenAlexW4390415082MaRDI QIDQ6201318

Stefan Schmid, Michelle Yeo, Jakub Svoboda

Publication date: 20 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114353

zbMATH Keywords

complexityapproximation algorithmsnetwork algorithmscryptocurrenciespayment channel networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The all-or-nothing multicommodity flow problem
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• The capacity of wireless networks
• Solving Linear Programs in the Current Matrix Multiplication Time
• Computational Complexity

This page was built for publication: Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation