fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf

Site Breadcrumb

Verkauf durch Sack Fachmedien

Dehne / Smid / Sack

Algorithms and Data Structures

8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings

Medium: Buch
ISBN: 978-3-540-40545-0
Verlag: Springer Berlin Heidelberg
Erscheinungstermin: 16.07.2003
In den Warenkorb
Lieferfrist: bis zu 10 Tage
Auf die Merkliste Drucken
Leseprobe
Überschrift

Beschreibung

Kostenloser Versand

nach Deutschland, Österreich und in die Schweiz

Bequem zahlen

Rechnung, Kreditkarte, PayPal oder Bankeinzug

Wir sind gerne für Sie da

0800 000-1378 (Inland)
service@fachmedien.de
<<Kontaktformular>>

Fragen

Fragen Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua
Anwtorten

Anwtorten At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet

The refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003.

The 40 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 126 submissions. A broad variety of current aspects in algorithmics and data structures is addressed.

Produkteigenschaften

  • Artikelnummer: 9783540405450
  • Medium: Buch
  • ISBN: 978-3-540-40545-0
  • Verlag: Springer Berlin Heidelberg
  • Erscheinungstermin: 16.07.2003
  • Sprache(n): Englisch
  • Auflage: 2003
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert
  • Gewicht: 1650 g
  • Seiten: 522
  • Format (B x H x T): 155 x 235 x 29 mm
  • Ausgabetyp: Kein, Unbekannt

Themen

Autoren/Hrsg.

Herausgeber

Multi-party Pseudo-Telepathy.- Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.- Shape Segmentation and Matching with Flow Discretization.- Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content.- Toward Optimal Motif Enumeration.- Common-Deadline Lazy Bureaucrat Scheduling Problems.- Bandwidth-Constrained Allocation in Grid Computing.- Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection.- Fast Algorithms for a Class of Temporal Range Queries.- Distribution-Sensitive Binomial Queues.- Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.- Extremal Configurations and Levels in Pseudoline Arrangements.- Fast Relative Approximation of Potential Fields.- The One-Round Voronoi Game Replayed.- Integrated Prefetching and Caching with Read and Write Requests.- Online Seat Reservations via Offline Seating Arrangements.- Routing and Call Control Algorithms for Ring Networks.- Algorithms and Models for Railway Optimization.- Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles.- Multi-way Space Partitioning Trees.- Cropping-Resilient Segmented Multiple Watermarking.- On Simultaneous Planar Graph Embeddings.- Smoothed Analysis.- Approximation Algorithm for Hotlink Assignments in Web Directories.- Drawing Graphs with Large Vertices and Thick Edges.- Semi-matchings for Bipartite Graphs and Load Balancing.- The Traveling Salesman Problem for Cubic Graphs.- Sorting Circular Permutations by Reversal.- An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data.- Dynamic Text and Static Pattern Matching.- Real Two Dimensional Scaled Matching.- Proximity Structures for Geometric Graphs.- The Zigzag Path of a Pseudo-Triangulation.- Alternating Paths along Orthogonal Segments.- Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem.- Chips on Wafers.- A Model for Analyzing Black-Box Optimization.- On the Hausdorff Voronoi Diagram of Point Clusters in the Plane.- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.- Significant-Presence Range Queries in Categorical Data.- Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree.- Parameterized Complexity of Directed Feedback Set Problems in Tournaments.- Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs.- New Directions and New Challenges in Algorithm Design and Complexity, Parameterized.