|
|
|
|
| LEADER |
02811nam a22005175i 4500 |
| 001 |
978-3-540-48824-8 |
| 003 |
DE-He213 |
| 005 |
20151204172652.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100324s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540488248
|9 978-3-540-48824-8
|
| 024 |
7 |
|
|a 10.1007/11922377
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a TK5105.5-5105.9
|
| 072 |
|
7 |
|a UKN
|2 bicssc
|
| 072 |
|
7 |
|a COM075000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.6
|2 23
|
| 245 |
1 |
0 |
|a Combinatorial and Algorithmic Aspects of Networking
|h [electronic resource] :
|b Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers /
|c edited by Thomas Erlebach.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
| 300 |
|
|
|a VIII, 134 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4235
|
| 505 |
0 |
|
|a Invited Lecture -- Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks -- Contributed Papers -- The Price of Anarchy in Selfish Multicast Routing -- Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem -- On the Topologies of Local Minimum Spanning Trees -- Distributed Routing in Tree Networks with Few Landmarks -- Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs -- On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing -- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP -- Acyclic Type-of-Relationship Problems on the Internet -- Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The ??d Case) -- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer organization.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Game theory.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Information Systems Applications (incl. Internet).
|
| 650 |
2 |
4 |
|a Computer Systems Organization and Communication Networks.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Game Theory, Economics, Social and Behav. Sciences.
|
| 700 |
1 |
|
|a Erlebach, Thomas.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540488224
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4235
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11922377
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
