| |
|
| Artikel-Nr.: 5667A-9783642132834 Herst.-Nr.: 9783642132834 EAN/GTIN: 9783642132834 |
| |
|
| | |
| Communication Complexity: From Two-Party to Multiparty.- On the Impact of Local Taxes in a Set Cover Game.- Towards Network Games with Social Preferences.- Distributed Weighted Stable Marriage Problem.- Traffic Grooming in Star Networks via Matching Techniques.- Event Extent Estimation.- Asynchronous Deterministic Rendezvous in Bounded Terrains.- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees.- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings.- Average Long-Lived Memoryless Consensus: The Three-Value Case.- Algorithms for Extracting Timeliness Graphs.- Distributed Tree Comparison with Nodes of Limited Memory.- Periodic Data Retrieval Problem in Rings Containing a Malicious Host.- A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots.- Maximum Interference of Random Sensors on a Line.- Multipath Spanners.- Strong Orientations of Planar Graphs with Bounded Stretch Factor.- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs.- Fast Algorithms for min independent dominating set. Weitere Informationen: | | Author: | Boaz Patt-Shamir; Tinaz Ekim | Verlag: | Springer Berlin | Sprache: | eng |
|
| | |
| | | |
| Weitere Suchbegriffe: allgemeine Informatikbücher - englischsprachig, allgemeine informatikbücher - englischsprachig, Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, EDV / Theorie / Informatik / Mathematik, Mathematik, Netzwerk (elektronisch), ad-hocnetworks; algorithms; anonymity; approximation; AsynchronousSystem; AutonomousSystem; algorithmanalysisandproblemcomplexity; datastructures, ad-hoc networks, algorithms, anonymity, approximation, asynchronous system |
| | |
| |