Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Computation: 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings > Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
Algorithms and Computation: 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings |
Takao Asano; Shin-ichi Nakano; Yoshio Okamoto; Osamu Watanabe
Springer Berlin Heidelberg
Algorithms and Computation: 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
Authors

Matias Korman

ARI Id

1664719243930_2907000

Access

Not Available Free

Pages

80-89

DOI

10.1007/978-3-642-25591-5_10

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-25591-5_10

Table of Contents of Book
Showing 1 to 20 of 80 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Algorithm Engineering for Route Planning – An Update –
Dorothea Wagner
1-5
Semidefinite Programming and Approximation Algorithms: A Survey
Sanjeev Arora
6-9
The School Bus Problem on Trees
Adrian Bock; Elyot Grant; Jochen Könemann; Laura Sanità
10-19
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph
M. Reza Khani; Mohammad R. Salavatipour
20-29
Improved Approximation Algorithms for Routing Shop Scheduling
Wei Yu; Guochuan Zhang
30-39
Contraction-Based Steiner Tree Approximations in Practice
Markus Chimani; Matthias Woste
40-49
Covering and Piercing Disks with Two Centers
Hee-Kap Ahn; Sang-Sub Kim; Christian Knauer; Lena Schlipf; Chan-Su Shin; Antoine Vigneron
50-59
Generating Realistic Roofs over a Rectilinear Polygon
Hee-Kap Ahn; Sang Won Bae; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron
60-69
Computing the Visibility Polygon Using Few Variables
Luis Barba; Matias Korman; Stefan Langerman; Rodrigo I. Silveira
70-79
Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
Matias Korman
80-89
Hamiltonian Paths in the Square of a Tree
Jakub Radoszewski; Wojciech Rytter
90-99
Dominating Induced Matchings for P 7-free Graphs in Linear Time
Andreas Brandstädt; Raffaele Mosca
100-109
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
Rémy Belmonte; Petr A. Golovach; Pinar Heggernes; Pim van ’t Hof; Marcin Kamiński; Daniël Paulusma
110-119
Recognizing Polar Planar Graphs Using New Results for Monopolarity
Van Bang Le; Ragnar Nevries
120-129
Robustness of Minimum Cost Arborescences
Naoyuki Kamiyama
130-139
Path Queries in Weighted Trees
Meng He; J. Ian Munro; Gelin Zhou
140-149
Dynamic Range Majority Data Structures
Amr Elmasry; Meng He; J. Ian Munro; Patrick K. Nicholson
150-159
Dynamic Range Selection in Linear Space
Meng He; J. Ian Munro; Patrick K. Nicholson
160-169
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
Yakov Nekrich
170-179
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 80 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings