Muutke küpsiste eelistusi

E-raamat: Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I

Edited by , Edited by , Edited by
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 6506
  • Ilmumisaeg: 06-Dec-2010
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783642175176
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 6506
  • Ilmumisaeg: 06-Dec-2010
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783642175176
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15-17, 2010. Past editions have been held in Tokyo, Taipei, Nagoya,HongKong,Beijing,Cairns,Osaka,Singapore,Taejon,Chennai,Taipei, Christchurch, Vancouver, Kyoto, Hong Kong, Hainan, Kolkata, Sendai, Gold Coast, and Hawaii over the years 1990-2009. ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to the call for papers, ISAAC 2010 received 182 papers. Each submission was reviewed by at least three Program Committee members with the assistance of external referees. Since there were many high-quality papers, the Program Committee's task was extremely di cult. Through an extensive discussion, the Program Committee accepted 77 of the submissions to be p- sented at the conference. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications,were prepared with selected papers from ISAAC 2010. The best paper award was given to "From Holant to #CSP and Back: c DichotomyforHolant Problems"byJin-YiCai,SangxiaHuangandPinyanLu, and the best student paper award to "Satis ability with Index Dependency" by Hongyu Liang and Jing He. Two eminent invited speakers,David Eppstein from UniversityofCalifornia,Irvine,andMattFranklinfromUniversityofCalifornia, Davis, also contributed to this volume.
Invited Talks
Regular Labelings and Geometric Structures (Abstract)
1(1)
David Eppstein
Algorithmic Aspects of Secure Computation and Communication (Abstract)
2(1)
Matt Franklin
Session 1A Approximation Algorithm I
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
3(12)
Marek Karpinski
Warren Schudy
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2
15(10)
Piotr Berman
Marek Karpinski
Alexander Zelikovsky
Approximate Periodicity
25(12)
Amihood Amir
Estrella Eisenberg
Avivit Levy
Approximating the Average Stretch Factor of Geometric Graphs
37(12)
Siu-Wing Cheng
Christian Knauer
Stefan Langerman
Michiel Smid
Session 1B Complexity I
Satisfiability with Index Dependency
49(12)
Hongyu Liang
Jing He
Anonymous Fuzzy Identity-Based Encryption for Similarity Search
61(12)
David W. Cheung
Nikos Mamoulis
W.K. Wong
S.M. Yiu
Ye Zhang
Improved Randomized Algorithms for 3-SAT
73(12)
Kazuo Iwama
Kazuhisa Seto
Tadashi Takai
Suguru Tamaki
Quantum Counterfeit Coin Problems
85(12)
Kazuo Iwama
Harumichi Nishimura
Rudy Raymond
Junichi Teruyama
Session 2A Data Structure and Algorithm I
Priority Range Trees
97(12)
Michael T. Goodrich
Darren Strash
Should Static Search Trees Ever Be Unbalanced?
109(12)
Prosenjit Bose
Karim Douieb
Levelwise Mesh Sparsification for Shortest Path Queries
121(12)
Yuichiro Miyamoto
Takeaki Uno
Mikio Kubo
Unit-Time Predecessor Queries on Massive Data Sets
133(12)
Andrej Brodnik
John Iacono
Session 2B Combinatorial Optimization
Popularity at Minimum Cost
145(12)
Telikepalli Kavitha
Meghana Nasre
Prajakta Nimbhorkar
Structural and Complexity Aspects of Line Systems of Graphs
157(12)
Jozef Jirasek
Pavel Klavik
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
169(13)
Akiyoshi Shioura
Generating Trees on Multisets
182(12)
Bingbing Zhuang
Hiroshi Nagamochi
Session 3A Graph Algorithm I
Seidel Minor Permutation Graphs and Combinatorial Properties
194(12)
Vincent Limouzy
Simultaneous Interval Graphs
206(12)
Krishnam Raju Jampani
Anna Lubiw
Unbalanced Graph Partitioning
218(12)
Angsheng Li
Peng Zhang
On the Intersection of Tolerance and Cocomparability Graphs
230(11)
George B. Mertzios
Shmuel Zaks
Flows in One-Crossing-Minor-Free Graphs
241(12)
Erin Chambers
David Eppstein
Session 3B Complexity II
From Holant to #CSP and Back: Dichotomy for Holantc Problems
253(13)
Jin-Yi Cai
Sangxia Huang
Pinyan Lu
Computing Sparse Multiples of Polynomials
266(13)
Mark Giesbrecht
Daniel S. Roche
Hrushikesh Tilak
Fractal Parallelism: Solving SAT in Bounded Space and Time
279(12)
Denys Duchier
Jerome Durand-Lose
Maxime Senot
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
291(13)
Hugo Feree
Emmanuel Hainry
Mathieu Hoyrup
Romain Pechoux
New Upper Bounds on the Average PTF Density of Boolean Functions
304(12)
Kazuyuki Amano
Session 4A Computational Geometry I
An Optimal Algorithm for Computing Angle-Constrained Spanners
316(12)
Paz Carmi
Michiel Smid
Approximating Minimum Bending Energy Path in a Simple Corridor
328(12)
Jinhui Xu
Lei Xu
Yulai Xie
Session 4B Graph Coloring I
Analysis of an Iterated Local Search Algorithm for Vertex Coloring
340(13)
Dirk Sudholt
Christine Zarges
Bounded Max-colorings of Graphs
353(13)
Evripidis Bampis
Alexander Kononov
Giorgio Lucarelli
Ioannis Milis
Session 5A Fixed Parameter Tractability
Parameterized Algorithms for Boxicity
366(12)
Abhijin Adiga
Rajesh Chitnis
Saket Saurabh
On Tractable Cases of Target Set Selection
378(12)
Andre Nichterlein
Rolf Niedermeier
Johannes Uhlmann
Mathias Weller
Combining Two Worlds: Parameterised Approximation for Vertex Cover
390(13)
Ljiljana Brankovic
Henning Fernau
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
403(12)
David Eppstein
Maarten Loffler
Darren Strash
Session 5B Optimization
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
415(12)
Thomas Dueholm Hansen
Uri Zwick
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
427(13)
Immanuel Bomze
Markus Chimani
Michael Junger
Ivana Ljubic
Petra Mutzel
Bernd Zey
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems
440(11)
Joachim Spoerhase
A Faster Algorithm for the Maximum Even Factor Problem
451(12)
Maxim A. Babenko
Author Index 463