Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=7074

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Algorithm engineering for route planning - An update
Dorothea Wagner
Lecture Notes in Computer Science 7074, 2011, pp. 1-5
Semidefinite programming and approximation algorithms: A survey
Sanjeev Arora
Lecture Notes in Computer Science 7074, 2011, pp. 6-9
The School Bus Problem The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not exceed the shortest distance from the child's home to the school by more than a given regret threshold. Subject to this constraint and bus capacity limit, the goal is to minimize the number of buses required. In this paper, we give a polynomial time 4-approximation algorithm when the children and school are located at vertices of a fixed tree. As a byproduct of our analysis, we show that the integrality gap of the natural set-cover formulation for this problem is also bounded by 4. We also present a constant approximation for the variant where we have a fixed number of buses to use, and the goal is to minimize the maximum regret.on trees
Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
Lecture Notes in Computer Science 7074, 2011, pp. 10-19
Improved approximations for Buy-at-Bulk and Shallow-Light k-Steiner trees and (k,2)-subgraph
M. Reza Khani, Mohammad R. Salavatipour
Lecture Notes in Computer Science 7074, 2011, pp. 20-29
Improved approximation algorithms for routing shop scheduling
Wei Yu, Guochuan Zhang
Lecture Notes in Computer Science 7074, 2011, pp. 30-39
Contraction-based Steiner tree approximations in practice
Markus Chimani, Matthias Woste
Lecture Notes in Computer Science 7074, 2011, pp. 40-49
Covering and piercing disks with two centers
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Lecture Notes in Computer Science 7074, 2011, pp. 50-59
Generating realistic roofs over a rectilinear polygon
Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
Lecture Notes in Computer Science 7074, 2011, pp. 60-69
Computing the visibility polygon using few variables
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira
Lecture Notes in Computer Science 7074, 2011, pp. 70-79
Minimizing interference in ad-hoc networks with bounded communication radius
Matias Korman
Lecture Notes in Computer Science 7074, 2011, pp. 80-89
Hamiltonian paths in the square of a tree
Jakub Radoszewski, Wojciech Rytter
Lecture Notes in Computer Science 7074, 2011, pp. 90-99
Dominating induced matchings for P_7-free graphs in linear time
Andreas Brandstädt, Raffaele Mosca
Lecture Notes in Computer Science 7074, 2011, pp. 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
Lecture Notes in Computer Science 7074, 2011, pp. 110-119
Recognizing polar planar graphs using new results for monopolarity
Van Bang Le, Ragnar Nevries
Lecture Notes in Computer Science 7074, 2011, pp. 120-129
Robustness of minimum cost arborescences
Naoyuki Kamiyama
Lecture Notes in Computer Science 7074, 2011, pp. 130-139
Path queries in weighted trees
Meng He, J. Ian Munro, Gelin Zhou
Lecture Notes in Computer Science 7074, 2011, pp. 140-149
Dynamic range majority data structures
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
Lecture Notes in Computer Science 7074, 2011, pp. 150-159
Dynamic range selection in linear space
Meng He, J. Ian Munro, Patrick K. Nicholson
Lecture Notes in Computer Science 7074, 2011, pp. 160-169
A dynamic stabbing-max data structure with sub-logarithmic query time
Yakov Nekrich
Lecture Notes in Computer Science 7074, 2011, pp. 170-179
Encoding 2D range maximum queries
Mordecai Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
Lecture Notes in Computer Science 7074, 2011, pp. 180-189
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
Lecture Notes in Computer Science 7074, 2011, pp. 190-199
Broadcasting in heterogeneous tree networks with uncertainty
Cheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin
Lecture Notes in Computer Science 7074, 2011, pp. 200-209
Optimal file distribution in peer-to-peer networks
Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
Lecture Notes in Computer Science 7074, 2011, pp. 210-219
Animal testing
Adrian Dumitrescu, Evan Hilscher
Lecture Notes in Computer Science 7074, 2011, pp. 220-229
Cutting out polygons with a circular saw
Adrian Dumitrescu, Masud Hasan
Lecture Notes in Computer Science 7074, 2011, pp. 230-239

Seiten 1 2 3 4 >