Algorithms and Data Structures 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Dehne, Frank (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sack, Jörg Rüdiger (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Smid, Michiel (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Έκδοση:1st ed. 2003.
Σειρά:Lecture Notes in Computer Science, 2748
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05326nam a2200601 4500
001 978-3-540-45078-8
003 DE-He213
005 20191029061431.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 |a 9783540450788  |9 978-3-540-45078-8 
024 7 |a 10.1007/b11837  |2 doi 
040 |d GrThAP 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Algorithms and Data Structures  |h [electronic resource] :  |b 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings /  |c edited by Frank Dehne, Jörg Rüdiger Sack, Michiel Smid. 
250 |a 1st ed. 2003. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2003. 
300 |a XII, 522 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2748 
505 0 |a 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. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Data structures (Computer science). 
650 0 |a Numerical analysis. 
650 0 |a Computer science-Mathematics. 
650 0 |a Computer graphics. 
650 1 4 |a Programming Techniques.  |0 http://scigraph.springernature.com/things/product-market-codes/I14010 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Data Structures.  |0 http://scigraph.springernature.com/things/product-market-codes/I15017 
650 2 4 |a Numeric Computing.  |0 http://scigraph.springernature.com/things/product-market-codes/I1701X 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
650 2 4 |a Computer Graphics.  |0 http://scigraph.springernature.com/things/product-market-codes/I22013 
700 1 |a Dehne, Frank.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Sack, Jörg Rüdiger.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Smid, Michiel.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662212875 
776 0 8 |i Printed edition:  |z 9783540405450 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2748 
856 4 0 |u https://doi.org/10.1007/b11837  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)