Algorithms and Computation : 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I
Uloženo v:
| Další autoři: | |
|---|---|
| Korporace: | |
| Médium: | E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Berlin ; Heidelberg :
Springer Berlin Heidelberg,
2010
|
| Edice: | Lecture Notes in Computer Science
|
| Žánr/forma: | elektronické knihy |
| ISBN: | 978-3-642-17517-6 9783642175169 |
| Témata: | |
| On-line přístup: | Plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| LEADER | 05147nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 001820450 | ||
| 003 | CZ PrSTK | ||
| 005 | 20170902072557.0 | ||
| 006 | m f d | ||
| 007 | cr nn 008mamaa | ||
| 008 | 101203s2010 gw | s |||| 0|eng d | ||
| 020 | |a 978-3-642-17517-6 |9 9783642175176 | ||
| 024 | 7 | |a 10.1007/978-3-642-17517-6 |2 doi | |
| 040 | |a DE-He213 |b cze |d ABA013 | ||
| 072 | 7 | |a 004 |x Počítačová věda. Výpočetní technika. Informační technologie |2 Konspekt |9 23 | |
| 080 | |a 004 |2 MRF | ||
| 245 | 1 | 0 | |a Algorithms and Computation : |b 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I / |c edited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park |
| 264 | 1 | |a Berlin ; |a Heidelberg : |b Springer Berlin Heidelberg, |c 2010 | |
| 300 | |a 1 online zdroj (XVIII, 465 stran) : |b 66 ilustrací | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a počítač |b c |2 rdamedia | ||
| 338 | |a online zdroj |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture Notes in Computer Science, |x 0302-9743 ; |v 6506 | |
| 505 | 0 | |a Invited Talks -- Regular Labelings and Geometric Structures -- Algorithmic Aspects of Secure Computation and Communication -- Session 1A. Approximation Algorithm I -- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament -- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 -- Approximate Periodicity -- Approximating the Average Stretch Factor of Geometric Graphs -- Session 1B. Complexity I -- Satisfiability with Index Dependency -- Anonymous Fuzzy Identity-Based Encryption for Similarity Search -- Improved Randomized Algorithms for 3-SAT -- Quantum Counterfeit Coin Problems -- Session 2A. Data Structure and Algorithm I -- Priority Range Trees -- Should Static Search Trees Ever Be Unbalanced? -- Levelwise Mesh Sparsification for Shortest Path Queries -- Unit-Time Predecessor Queries on Massive Data Sets -- Session 2B. Combinatorial Optimization -- Popularity at Minimum Cost -- | |
| 505 | 0 | |9 ^^ |a Structural and Complexity Aspects of Line Systems of Graphs -- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra -- Generating Trees on Multisets -- Session 3A. Graph Algorithm I -- Seidel Minor, Permutation Graphs and Combinatorial Properties -- Simultaneous Interval Graphs -- Unbalanced Graph Partitioning -- On the Intersection of Tolerance and Cocomparability Graphs -- Flows in One-Crossing-Minor-Free Graphs -- Session 3B. Complexity II -- From Holant to #CSP and Back: Dichotomy for Holant c Problems -- Computing Sparse Multiples of Polynomials -- Fractal Parallelism: Solving SAT in Bounded Space and Time -- Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity -- New Upper Bounds on the Average PTF Density of Boolean Functions -- Session 4A. Computational Geometry I -- An Optimal Algorithm for Computing Angle-Constrained Spanners -- Approximating Minimum Bending Energy Path in a Simple Corridor -- Session 4B. Graph Coloring I -- | |
| 505 | 0 | |9 ^^ |a Analysis of an Iterated Local Search Algorithm for Vertex Coloring -- Bounded Max-colorings of Graphs -- Session 5A. Fixed Parameter Tractability -- Parameterized Algorithms for Boxicity -- On Tractable Cases of Target Set Selection -- Combining Two Worlds: Parameterised Approximation for Vertex Cover -- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time -- Session 5B. Optimization -- Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles -- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut -- An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems -- A Faster Algorithm for the Maximum Even Factor Problem | |
| 655 | 7 | |a elektronické knihy |7 fd186907 |2 czenas | |
| 659 | 0 | |a Computer science | |
| 659 | 0 | |a Computer communication systems | |
| 659 | 0 | |a Computer programming | |
| 659 | 0 | |a Data structures (Computer science) | |
| 659 | 0 | |a Algorithms | |
| 659 | 0 | |a Computer science |x Mathematics | |
| 659 | 0 | |a Computer graphics | |
| 659 | 1 | 4 | |a Computer Science |
| 659 | 2 | 4 | |a Programming Techniques |
| 659 | 2 | 4 | |a Algorithm Analysis and Problem Complexity |
| 659 | 2 | 4 | |a Discrete Mathematics in Computer Science |
| 659 | 2 | 4 | |a Computer Communication Networks |
| 659 | 2 | 4 | |a Computer Graphics |
| 659 | 2 | 4 | |a Data Structures |
| 650 | 0 | 7 | |a informatika |x if |7 psh6548 |2 psh |
| 650 | 0 | 7 | |a programování |x vt |7 psh12467 |2 psh |
| 650 | 0 | 7 | |a algoritmizace |x vt |7 psh12472 |2 psh |
| 650 | 0 | 7 | |a počítačová grafika |x vt |7 psh12567 |2 psh |
| 700 | 1 | |a Cheong, Otfried |4 edt | |
| 700 | 1 | |a Chwa, Kyung-Yong |4 edt | |
| 700 | 1 | |a Park, Kunsoo |4 edt | |
| 710 | 2 | |a SpringerLink (online služba) |7 ntk2018999494 | |
| 776 | 0 | 8 | |i Tištěné vydání: |t Algorithms and Computation : 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I |z 9783642175169 |
| 830 | 0 | |a Lecture Notes in Computer Science | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-17517-6 |y Plný text |
| 910 | |a ABA013 | ||
| 950 | |a Springer |b Lecture Notes in Computer Science 2017 | ||