• 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. Systemvetenskap och AI

      Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

      8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings

      AvChandra Chekuri,Klaus Jansen

      Häftad, Engelska, 2005

      Del i serien Lecture Notes in Computer Science

      549 kr

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

      Beskrivning

      This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop on Randomization and Computation(RANDOM2005),whichtookplaceconcurrentlyattheUniversity of California in Berkeley, on August 22-24, 2005. APPROX focuses on algori- mic and complexity issues surrounding the development of e?cient approximate solutions to computationally hard problems, and APPROX 2005 was the eighth in the series after Aalborg (1998), Berkeley (1999), Saarbru ..cken (2000), Ber- ley (2001),Rome (2002),Princeton(2003),and Cambridge(2004).RANDOM is concerned with applications of randomness to computational and combinatorial problems, and RANDOM 2005 was the ninth workshop in the series foll- ing Bologna (1997), Barcelona (1998), Berkeley(1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), and Cambridge (2004).Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network designandrouting,packingand covering,scheduling,designandanalysisofr- domized algorithms, randomized complexity theory, pseudorandomness and - randomization,random combinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, r- dom projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of - proximation and randomness. The volume contains 20 contributed papers selected by the APPROX P- gram Committee out of 50 submissions, and 21 contributed papers selected by the RANDOM Program Committee out of 51 submissions.

      Produktinformation

      • Utgivningsdatum:2005-08-08
      • Mått:155 x 235 x 28 mm
      • Vikt:768 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:495
      • Upplaga:2005
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783540282396

      Utforska kategorier

      • Systemvetenskap och AI inom Data och IT
      • Kombinatorik och grafteori inom Naturvetenskap och teknik
      • Beräkning och matematisk analys inom Naturvetenskap och teknik

      Innehållsförteckning

      • Contributed Talks of APPROX.- The Network as a Storage Device: Dynamic Routing with Bounded Buffers.- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.- A Rounding Algorithm for Approximating Minimum Manhattan Networks.- Packing Element-Disjoint Steiner Trees.- Approximating the Bandwidth of Caterpillars.- Where’s the Winner? Max-Finding and Sorting with Metric Costs.- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.- The Complexity of Making Unique Choices: Approximating 1-in-k SAT.- Approximating the Distortion.- Approximating the Best-Fit Tree Under L p Norms.- Beating a Random Assignment.- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.- Approximation Algorithms for Network Design and Facility Location with Service Capacities.- Finding Graph Matchings in Data Streams.- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.- Efficient Approximation of Convex Recolorings.- Approximation Algorithms for Requirement Cut on Graphs.- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.- Contributed Talks of RANDOM.- Bounds for Error Reduction with Few Quantum Queries.- Sampling Bounds for Stochastic Optimization.- An Improved Analysis of Mergers.- Finding a Maximum Independent Set in a Sparse Random Graph.- On the Error Parameter of Dispersers.- Tolerant Locally Testable Codes.- A Lower Bound on List Size for List Decoding.- A Lower Bound for Distribution-Free Monotonicity Testing.- On Learning Random DNF Formulas Under the Uniform Distribution.-Derandomized Constructions of k-Wise (Almost) Independent Permutations.- Testing Periodicity.- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.- The Online Clique Avoidance Game on Random Graphs.- A Generating Function Method for the Average-Case Analysis of DPLL.- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.- Mixing Points on a Circle.- Derandomized Squaring of Graphs.- Tight Bounds for String Reconstruction Using Substring Queries.- Reconstructive Dispersers and Hitting Set Generators.- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable.- Fractional Decompositions of Dense Hypergraphs.
      Hoppa över listan

      Du kanske också är intresserad av

      Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Häftad

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim

      Häftad, 2007

      1 127 kr

      Luca Trevisan, Jose D.P. Rolim, Klaus Jansen, Chandra Chekuri - Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, E-bok

      Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

      Luca Trevisan, Jose D.P. Rolim, Klaus Jansen, Chandra Chekuri

      E-bok
      2005

      710 kr

      Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Häftad

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim

      Häftad, 2011

      566 kr

      Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan - Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, Häftad

      Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

      Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan

      Häftad, 2001

      549 kr

      Anupam Gupta, Klaus Jansen, José D.P. Rolim, ROCCO SERVEDIO - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Häftad

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Anupam Gupta, Klaus Jansen, José D.P. Rolim, ROCCO SERVEDIO

      Häftad, 2012

      549 kr

      Luca Trevisan, Jose D.P. Rolim, Klaus Jansen, Michel Goemans - Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, E-bok

      Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

      Luca Trevisan, Jose D.P. Rolim, Klaus Jansen, Michel Goemans

      E-bok
      2003

      710 kr

      Jose D.P. Rolim, R. Ravi, Klaus Jansen, Leslie Ann Goldberg - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, E-bok

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Jose D.P. Rolim, R. Ravi, Klaus Jansen, Leslie Ann Goldberg

      E-bok
      2011

      718 kr

      Alistair Sinclair, Jose D.P. Rolim, Klaus Jansen, Dorit Hochbaum - Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, E-bok

      Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques

      Alistair Sinclair, Jose D.P. Rolim, Klaus Jansen, Dorit Hochbaum

      E-bok
      2004

      710 kr

      Dorit Hochbaum, Klaus Jansen, Jose D.P. Rolim, Alistair Sinclair - Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, Häftad

      Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques

      Dorit Hochbaum, Klaus Jansen, Jose D.P. Rolim, Alistair Sinclair

      Häftad, 1999

      549 kr

      Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Häftad

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim

      Häftad, 2013

      549 kr