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

We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u,v) is determined by how many nodes u and v allocate for this link. Specifically, the input is a finite ordered sequenc...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 989; p. 114353
Main Authors:	Schmid, Stefan, Svoboda, Jakub, Yeo, Michelle
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 21.03.2024
Subjects:	Approximation algorithms Complexity Cryptocurrencies Network algorithms Payment channel networks Network algorithms Cryptocurrencies Approximation algorithms Payment channel networks Complexity
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!