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

DOI10.1007/978-3-031-32733-9_26arXiv2204.13459OpenAlexW4377971946MaRDI QIDQ6148085

Jakub Svoboda, Michelle Yeo, Stefan Schmid

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.13459

zbMATH Keywords

complexityapproximation algorithmsnetwork algorithmscryptocurrenciespayment channel networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

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
• \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks

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