• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel och pussel

Skapa nya rutiner – hälsoböcker upp till 50% →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Data och IT
    2. Informationsteknik: allmänt

    Algorithms and Data Structures

    9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings

    AvFrank Dehne,Alejandro López-Ortiz

    Häftad, Engelska, 2005

    Del i serien Lecture Notes in Computer Science

    557 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Beskrivning

    The papers in this volume were presented at the 9th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place during August 15 - 17, 2005, at the University of Waterloo, Waterloo, Canada. The workshop alternateswith the ScandinavianWorkshopon Algorithm Theory(SWAT), c- tinuing the traditionof SWAT and WADS startingwith SWAT 1988and WADS 1989. From 90 submissions, the Program Committee selected 37 papers for p- sentation at the workshop. In addition, invited lectures were given by the f- lowing distinguished researchers: Allan Borodin and Max J. Egenhofer. OnbehalfoftheProgramCommittee,wewouldliketoexpressoursincere- preciation to the many persons whose e?ort contributed to making WADS 2005 a success. These include the invited speakers,members of the ste- ing and ProgramCommittees, the authors who submitted papers, and the many referees who assisted the ProgramCommittee. We are indebted to Robert Kane forinstallingandmodifyingthesubmissionsoftware,maintainingthesubmission server and interacting with authors as well as for helping with the preparation of the program. August 2005 Frank Dehne, Alejandro Lop ' ez-Ortiz, and Jorg-R .. u ..diger Sack WADS Organization Organizing Institutions Steering Committee Frank Dehne Carleton University, Canada Ian Munro University of Waterloo, Canada J.. org-Rudig .. er Sack Carleton University, Canada Roberto Tamassia Brown University, Canada Program Co-chairs Frank Dehne Carleton University, Canada Alejandro Lop ' ez-Ortiz University of Waterloo, Canada J.. org-Rudig .. er Sack Carleton University, Canada Conference Chair Alejandro Lop ' ez-Ortiz University of Waterloo, Canada Program Committee Pankaj Agarwal Duke University, USA Michael Atkinson University of Otago, New Zealand Gill Barequet Technion, Israel Mark de Berg Tech.

    Produktinformation

    • Utgivningsdatum:2005-08-04
    • Mått:155 x 235 x 25 mm
    • Vikt:698 g
    • Format:Häftad
    • Språk:Engelska
    • Serie:Lecture Notes in Computer Science
    • Antal sidor:450
    • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
    • ISBN:9783540281016

    Utforska kategorier

    • Informationsteknik: allmänt inom Data och IT

    Innehållsförteckning

    • Session 1.- Towards a Theory of Algorithms.- Session 2A.- k-Restricted Rotation with an Application to Search Tree Rebalancing.- Heap Building Bounds.- Session 2B.- The Multi-radius Cover Problem.- Parameterized Complexity of Generalized Vertex Cover Problems.- The Complexity of Implicit and Space Efficient Priority Queues.- Analysis of a Class of Tries with Adaptive Multi-digit Branching.- Balanced Aspect Ratio Trees Revisited.- Session 3B.- Improved Combinatorial Group Testing for Real-World Problem Sizes.- Parameterized Counting Algorithms for General Graph Covering Problems.- Approximating the Online Set Multicover Problems via Randomized Winnowing.- Session 4A.- Max-stretch Reduction for Tree Spanners.- Succinct Representation of Triangulations with a Boundary.- Line-Segment Intersection Made In-Place.- Session 4B.- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.- Communication-Aware Processor Allocation for Supercomputers.- Dynamic Hotlinks.- Session 6A.- The Minimum-Area Spanning Tree Problem.- Hinged Dissection of Polypolyhedra.- Session 6B.- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms.- Linear Time Algorithms for Generalized Edge Dominating Set Problems.- Session 7A.- On Geometric Dilation and Halving Chords.- Orthogonal Subdivisions with Low Stabbing Numbers.- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes.- Session 7B.- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length.- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs.- The On-line Asymmetric Traveling Salesman Problem.- Session 8A.- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time.- k-Link Shortest Paths in Weighted Subdivisions.- Power-SavingScheduling for Weakly Dynamic Voltage Scaling Devices.- Session 8B.- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems.- On the Vehicle Routing Problem.- Session 9A.- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case.- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.- Derandomization of Dimensionality Reduction and SDP Based Algorithms.- Session 9B.- Subquadratic Algorithms for 3SUM.- Near-Optimal Pricing in Near-Linear Time.- Improved Approximation Bounds for Planar Point Pattern Matching.
    Hoppa över listan

    Du kanske också är intresserad av

    Frank Dehne, John Iacono, Jörg-Rüdiger Sack - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, John Iacono, Jörg-Rüdiger Sack

    Häftad, 2011

    541 kr

    Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege - Algorithms and Data Structures, Häftad
    Del 9214

    Algorithms and Data Structures

    Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege

    Häftad, 2015

    541 kr

    Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack

    Häftad, 2013

    541 kr

    Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh

    Häftad, 2007

    1 107 kr

    Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro

    Häftad, 1989

    557 kr

    Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides

    Häftad, 1993

    1 075 kr

    Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia

    Häftad, 2001

    557 kr

    Frank Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia

    Häftad, 1999

    557 kr

    Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia

    Häftad, 1997

    557 kr

    Frank Dehne, Jörg-Rüdiger Sack, Csaba D. Toth - Algorithms and Data Structures, Häftad

    Algorithms and Data Structures

    Frank Dehne, Jörg-Rüdiger Sack, Csaba D. Toth

    Häftad, 2009

    557 kr