000 03716nam a22005535i 4500
001 978-3-642-13284-1
003 DE-He213
005 20140220084537.0
007 cr nn 008mamaa
008 100605s2010 gw | s |||| 0|eng d
020 _a9783642132841
_9978-3-642-13284-1
024 7 _a10.1007/978-3-642-13284-1
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aPatt-Shamir, Boaz.
_eeditor.
245 1 0 _aStructural Information and Communication Complexity
_h[electronic resource] :
_b17th International Colloquium, SIROCCO 2010, Şirince, Turkey, June 7-11, 2010. Proceedings /
_cedited by Boaz Patt-Shamir, Tınaz Ekim.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _a273p. 42 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6058
505 0 _aCommunication 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.
520 _aThis book constitutes the refereed proceedings of the 17th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2010, held in Sirince, Turkey, in June 2010. The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. The volume also contains the abstract of one invited talk. The papers are organized in topical section on game theory, network algorithms, motion planning, asynchrony, network algorithms, motion planning, topology algorithms, and graph algorithms.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aAlgorithms.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Communication Networks.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
650 2 4 _aAlgorithms.
700 1 _aEkim, Tınaz.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642132834
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6058
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-13284-1
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112226
_d112226