|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Boaz Patt-Shamir , Tinaz EkimPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Volume: 6058 Dimensions: Width: 15.50cm , Height: 1.50cm , Length: 23.10cm Weight: 0.454kg ISBN: 9783642132834ISBN 10: 3642132839 Pages: 273 Publication Date: 21 May 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Awaiting stock ![]() The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you. Table of ContentsCommunication 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |