Emergency Connectivity in Ad-hoc Networks with Selfish Nodes (English)
- New search for: Karakostas, George
- New search for: Markou, Euripides
- New search for: Karakostas, George
- New search for: Markou, Euripides
In:
Algorithmica
;
68
, 2
;
358-389
;
2012
- Article (Journal) / Electronic Resource
-
Title:Emergency Connectivity in Ad-hoc Networks with Selfish Nodes
-
Contributors:Karakostas, George ( author ) / Markou, Euripides ( author )
-
Published in:Algorithmica ; 68, 2 ; 358-389
-
Publisher:
- New search for: Springer US
-
Place of publication:Boston
-
Publication date:2012-08-03
-
Size:32 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 68, Issue 2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 287
-
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus GraphsBorradaile, Glencora / Demaine, Erik D. / Tazari, Siamak et al. | 2012
- 312
-
Approximation Algorithms for Intersection GraphsKammer, Frank / Tholey, Torsten et al. | 2012
- 337
-
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning TreeBilò, Davide / Gualà, Luciano / Proietti, Guido et al. | 2012
- 358
-
Emergency Connectivity in Ad-hoc Networks with Selfish NodesKarakostas, George / Markou, Euripides et al. | 2012
- 390
-
A Randomized O($ log^{2} $k)-Competitive Algorithm for Metric Bipartite MatchingBansal, Nikhil / Buchbinder, Niv / Gupta, Anupam / Naor, Joseph (Seffi) et al. | 2012
- 404
-
Speed Scaling on Parallel ProcessorsAlbers, Susanne / Müller, Fabian / Schmelzer, Swen et al. | 2012
- 426
-
An Optimal Lower Bound for Buffer Management in Multi-Queue SwitchesBienkowski, Marcin et al. | 2012
- 448
-
Relative Convex Hulls in Semi-Dynamic ArrangementsIshaque, Mashhood / Tóth, Csaba D. et al. | 2012
- 483
-
The Complexity of the Empire Colouring ProblemMcGrae, Andrew R. A. / Zito, Michele et al. | 2012
- 504
-
The Kernelization Complexity of Connected Domination in Graphs with (no) Small CyclesMisra, Neeldhara / Philip, Geevarghese / Raman, Venkatesh / Saurabh, Saket et al. | 2012
- 531
-
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane GraphsHe, Xin / Zhang, Huaming et al. | 2012