000 | 03786nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-27796-5 | ||
003 | DE-He213 | ||
005 | 20240423130116.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2004 gw | s |||| 0|eng d | ||
020 |
_a9783540277965 _9978-3-540-27796-5 |
||
024 | 7 |
_a10.1007/b98251 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM043000 _2bisacsh |
|
072 | 7 |
_aUKN _2thema |
|
082 | 0 | 4 |
_a004.6 _223 |
245 | 1 | 0 |
_aStructural Information and Communication Complexity _h[electronic resource] : _b11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings / _cedited by Ratislav Královic, Ondrej Sykora. |
250 | _a1st ed. 2004. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
300 |
_aX, 303 p. _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, _x1611-3349 ; _v3104 |
|
505 | 0 | _aTraffic Grooming in a Passive Star WDM Network -- The Price of Anarchy in All-Optical Networks -- Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks -- Path Layout on Tree Networks: Bounds in Different Label Switching Models -- On Approximability of the Independent Set Problem for Low Degree Graphs -- Asynchronous Broadcast in Radio Networks -- Two-Hop Virtual Path Layout in Tori -- Robot Convergence via Center-of-Gravity Algorithms -- F-Chord: Improved Uniform Routing on Chord -- Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor -- Improved Bounds for Optimal Black Hole Search with a Network Map -- Sparse Additive Spanners for Bounded Tree-Length Graphs -- No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes -- Existence of Nash Equilibria in Selfish Routing Problems -- Mobile Agents Rendezvous When Tokens Fail -- Time Efficient Gossiping in Known Radio Networks -- Long-Lived Rambo: Trading Knowledge for Communication -- Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach -- Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks -- Perfect Token Distribution on Trees -- Approximation Algorithm for Hotlink Assignment in the Greedy Model -- Optimal Decision Strategies in Byzantine Environments -- Sharing the Cost of Multicast Transmissions in Wireless Networks -- NP-Completeness Results for All-Shortest-Path Interval Routing -- On-Line Scheduling of Parallel Jobs -- The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 1 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData Science. |
700 | 1 |
_aKrálovic, Ratislav. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSykora, Ondrej. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540222309 |
776 | 0 | 8 |
_iPrinted edition: _z9783662169100 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3104 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b98251 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c185144 _d185144 |