Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Link Reversal Routing with Binary Link Labels: Work Complexity

From MaRDI portal
Publication:2840988
Jump to:navigation, search

DOI10.1137/110843095zbMath1271.68243OpenAlexW2085140302MaRDI QIDQ2840988

Bernadette Charron-Bost, Josef Widder, Antoine Gaillard, Jennifer Lundelius Welch

Publication date: 24 July 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1969.1/178676


zbMATH Keywords

wireless networkscomplexity of algorithmsapplications of game theorylink reversal routing


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Applications of game theory (91A80) Distributed algorithms (68W15)


Related Items (1)

New transience bounds for max-plus linear systems






This page was built for publication: Link Reversal Routing with Binary Link Labels: Work Complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2840988&oldid=15765796"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki