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...

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 989; s. 114353
Hlavní autoři:	Schmid, Stefan, Svoboda, Jakub, Yeo, Michelle
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 21.03.2024
Témata:	Approximation algorithms Complexity Cryptocurrencies Network algorithms Payment channel networks Network algorithms Cryptocurrencies Approximation algorithms Payment channel networks Complexity
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!