• 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
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

Upp till 20% på populära nyheter →

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
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare

    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
      • Populära bokserier
      • 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 @ 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. Programmeringsböcker

      Algorithms and Computation

      21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I

      AvOtfried Cheong,Kyung-Yong Chwa

      Häftad, Engelska, 2010

      Del i serien Lecture Notes in Computer Science

      577 kr

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

      Beskrivning

      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.

      Produktinformation

      • Utgivningsdatum:2010-12-02
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:465
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783642175169

      Utforska kategorier

      • Programmeringsböcker inom Data och IT

      Innehållsförteckning

      • 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.- 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 Algorithmfor Computing Angle-Constrained Spanners.- Approximating Minimum Bending Energy Path in a Simple Corridor.- Session 4B. Graph Coloring I.- 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.
      Hoppa över listan

      Du kanske också är intresserad av

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong - Algorithms and Computation, E-bok

      Algorithms and Computation

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong

      E-bok
      2010

      712 kr

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong - Algorithms and Computation, E-bok

      Algorithms and Computation

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong

      E-bok
      2010

      1 148 kr

      Kunsoo Park, Maxime Crochemore, Alberto Apostolico - Combinatorial Pattern Matching, E-bok

      Combinatorial Pattern Matching

      Kunsoo Park, Maxime Crochemore, Alberto Apostolico

      E-bok
      2005

      718 kr

      Alberto Apostolico, Maxime Crochemore, Kunsoo Park - Combinatorial Pattern Matching, Häftad

      Combinatorial Pattern Matching

      Alberto Apostolico, Maxime Crochemore, Kunsoo Park

      Häftad, 2005

      577 kr

      Otfried Cheong, Mark Overmars, Marc van Krefeld, Mark de Berg - Computational Geometry, E-bok

      Computational Geometry

      Otfried Cheong, Mark Overmars, Marc van Krefeld, Mark de Berg

      E-bok
      2013

      1 136 kr

      Kyung-Yong Chwa, Oscar H. Ibarra - Algorithms and Computation, Häftad

      Algorithms and Computation

      Kyung-Yong Chwa, Oscar H. Ibarra

      Häftad, 1998

      577 kr

      Munro, Kyung-Yong Chwa - Computing and Combinatorics, E-bok

      Computing and Combinatorics

      Munro, Kyung-Yong Chwa

      E-bok
      2004

      718 kr

      Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars - Computational Geometry, Inbunden

      Computational Geometry

      Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars

      Inbunden, 2008

      615 kr

      Oscar H. Ibarra, Kyung-Yong Chwa - Algorithms and Computation, E-bok

      Algorithms and Computation

      Oscar H. Ibarra, Kyung-Yong Chwa

      E-bok
      2003

      718 kr

      Kyung-Yong Chwa, Munro - Computing and Combinatorics, Häftad

      Computing and Combinatorics

      Kyung-Yong Chwa, Munro

      Häftad, 2004

      577 kr