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

DOI10.1016/J.TCS.2023.114353MaRDI QIDQ6201318zbMATH OpenOpenAlexFDO

Authors Stefan Schmid, Jakub Svoboda, Michelle Yeo

Publication date 20 February 2024

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

approximation algorithmscomplexitycryptocurrenciesnetwork algorithmspayment channel networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201318)