Algorithms and Computation 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Bose, Prosenjit K. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Morin, Pat (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Έκδοση:1st ed. 2002.
Σειρά:Lecture Notes in Computer Science, 2518
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 06825nam a2200601 4500
001 978-3-540-36136-7
003 DE-He213
005 20191220125853.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 |a 9783540361367  |9 978-3-540-36136-7 
024 7 |a 10.1007/3-540-36136-7  |2 doi 
040 |d GrThAP 
050 4 |a T57-57.97 
072 7 |a PBW  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
072 7 |a PBW  |2 thema 
082 0 4 |a 519  |2 23 
245 1 0 |a Algorithms and Computation  |h [electronic resource] :  |b 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings /  |c edited by Prosenjit K. Bose, Pat Morin. 
250 |a 1st ed. 2002. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2002. 
300 |a XIV, 662 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 2518 
505 0 |a Session 1A -- Biased Skip Lists -- Space-Efficient Data Structures for Flexible Text Retrieval Systems -- Key Independent Optimality -- On the Comparison-Addition Complexity of All-Pairs Shortest Paths -- On the Comparison-Addition Complexity of All-Pairs Shortest Paths -- On the Clique-Width of Graphs in Hereditary Classes -- On the Clique-Width of Graphs in Hereditary Classes -- The Probability of a Rendezvous Is Minimal in Complete Graphs -- The Probability of a Rendezvous Is Minimal in Complete Graphs -- On the Minimum Volume of a Perturbed Unit Cube -- On the Minimum Volume of a Perturbed Unit Cube -- Non-Delaunay-Based Curve Reconstruction -- Non-Delaunay-Based Curve Reconstruction -- Cutting a Country for Smallest Square Fit -- Cutting a Country for Smallest Square Fit -- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter -- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter -- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement -- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement -- Some Remarks on the L-Conjecture -- Some Remarks on the L-Conjecture -- Session 3A -- A Framework for Network Reliability Problems on Graphs of Bounded Treewidth -- A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation -- Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems -- Session 3B -- An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering -- Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint -- A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage -- Session 4A -- Queaps -- Funnel Heap-A Cache Oblivious Priority Queue -- Characterizing History Independent Data Structures -- Session 4B -- Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set -- An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover -- Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs -- Session 5A -- Casting a Polyhedron with Directional Uncertainty -- Hierarchy of Surface Models and Irreducible Triangulation -- Algorithms and Complexity for Tetrahedralization Detections -- Session 5B -- Average-Case Communication-Optimal Parallel Parenthesis Matching -- Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks -- New Results for Energy-Efficient Broadcasting in Wireless Networks -- Session 6A -- An Improved Algorithm for the Minimum Manhattan Network Problem -- Approximate Distance Oracles Revisited -- Flat-State Connectivity of Linkages under Dihedral Motions -- Session 6B -- Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms -- Scheduling of Independent Dedicated Multiprocessor Tasks -- On the Approximability of Multiprocessor Task Scheduling Problems -- Session 7A -- Bounded-Degree Independent Sets in Planar Graphs -- Minimum Edge Ranking Spanning Trees of Threshold Graphs -- File Transfer Tree Problems -- Session 7B -- Approximation Algorithms for Some Parameterized Counting Problems -- Approximating MIN k-SAT -- Average-Case Competitive Analyses for Ski-Rental Problems -- Session 8A -- On the Clique Problem in Intersection Graphs of Ellipses -- A Geometric Approach to Boolean Matrix Multiplication -- The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing -- Session 8B -- Improved Distance Oracles for Avoiding Link-Failure -- Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks -- A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm -- Session 9A -- Crossing Minimization for Symmetries -- Simultaneous Embedding of a Planar Graph and Its Dual on the Grid -- Meaningful Information -- Session 9B -- Optimal Clearing of Supply/Demand Curves -- Partitioning Trees of Supply and Demand -- Maximizing a Voronoi Region: The Convex Case -- Invited Talks -- Random Tries -- Expected Acceptance Counts for Finite Automata with Almost Uniform Input -- Monotone Drawings of Planar Graphs. 
650 0 |a Applied mathematics. 
650 0 |a Engineering mathematics. 
650 0 |a Computers. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Computer communication systems. 
650 0 |a Data structures (Computer science). 
650 1 4 |a Applications of Mathematics.  |0 http://scigraph.springernature.com/things/product-market-codes/M13003 
650 2 4 |a Theory of Computation.  |0 http://scigraph.springernature.com/things/product-market-codes/I16005 
650 2 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 Computer Communication Networks.  |0 http://scigraph.springernature.com/things/product-market-codes/I13022 
650 2 4 |a Data Structures.  |0 http://scigraph.springernature.com/things/product-market-codes/I15017 
700 1 |a Bose, Prosenjit K.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Morin, Pat.  |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 9783662207987 
776 0 8 |i Printed edition:  |z 9783540001423 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2518 
856 4 0 |u https://doi.org/10.1007/3-540-36136-7  |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)