• 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

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings

      AvIrit Dinur,Klaus Jansen

      Häftad, Engelska, 2009

      Del i serien Lecture Notes in Computer Science

      1 124 kr

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

      Beskrivning

      This volume contains the papers presented at the 12th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009) and the 13th International Workshop on Randomization and Computation (RANDOM 2009), which took place concurrently at the HP - ditorium in UC Berkeley, USA, during August 21-23, 2009. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 12th in the series after Aalborg (1998), Berkeley (1999), Saarbru ..cken (2000), Ber- ley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 13th workshop in the series following Bologna (1997), Barcelona (1998),Berkeley(1999),Geneva(2000),Berkeley(2001),Harvard(2002),Prin- ton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008).Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space algorithms, sub-linear time algorithms, streaming algorithms, embeddings and metric space methods,mathematicalprogrammingmethods,combinatorialproblemsingraphs andnetworks,gametheory,markets,andeconomicapplications,geometricpr- lems, packing, covering, scheduling, approximate learning, design and analysis of online algorithms, randomized complexity theory, pseudorandomness and - randomization,randomcombinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, err- correctingcodes,average-caseanalysis,propertytesting,computationallearning theory, and other applications of approximation and randomness. The volume contains 25 contributed papers, selected by the APPROX Program Committee out of 56 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 57 submissions.

      Produktinformation

      • Utgivningsdatum:2009-08-06
      • Mått:155 x 235 x 41 mm
      • Vikt:1 124 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:742
      • Upplaga:2009
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783642036842

      Utforska kategorier

      • Programmeringsböcker inom Data och IT

      Innehållsförteckning

      • Contributed Talks of APPROX.- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.- Adaptive Sampling for k-Means Clustering.- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs.- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.- Truthful Mechanisms via Greedy Iterative Packing.- Resource Minimization Job Scheduling.- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.- New Hardness Results for Diophantine Approximation.- PASS Approximation.- Optimal Sherali-Adams Gaps from Pairwise Independence.- An Approximation Scheme for Terrain Guarding.- Scheduling with Outliers.- Improved Inapproximability Results for Maximum k-Colorable Subgraph.- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.- On the Optimality of Gluing over Scales.- On Hardness of Pricing Items for Single-Minded Bidders.- Real-Time Message Routing and Scheduling.- Approximating Some Network Design Problems with Node Costs.- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy.- Minimizing Average Shortest Path Distances via Shortcut Edge Addition.- Approximating Node-Connectivity Augmentation Problems.- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.- On the Complexity of the Asymmetric VPN Problem.- Contributed Talks of RANDOM.- Deterministic Approximation Algorithms for the Nearest Codeword Problem.- Strong Parallel Repetition Theorem for Free Projection Games.- Random Low Degree Polynomials are Hard to Approximate.- Composition of Semi-LTCs by Two-Wise Tensor Products.- On the Security of Goldreich’s One-Way Function.- Random Tensors and Planted Cliques.- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry.- Average-Case Analyses of Vickrey Costs.- A Hypergraph Dictatorship Test with Perfect Completeness.- Extractors Using Hardness Amplification.- How Well Do Random Walks Parallelize?.- An Analysis of Random-Walk Cuckoo Hashing.- Hierarchy Theorems for Property Testing.- Algorithmic Aspects of Property Testing in the Dense Graphs Model.- Succinct Representation of Codes with Applications to Testing.- Efficient Quantum Tensor Product Expanders and k-Designs.- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND.- Pseudorandom Generators and Typically-Correct Derandomization.- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions.- Tolerant Linearity Testing and Locally Testable Codes.- Pseudorandom Bit Generators That Fool Modular Sums.- The Glauber Dynamics for Colourings of Bounded Degree Trees.- Testing ±1-weight halfspace.- Small-Bias Spaces for Group Products.- Small Clique Detection and Approximate Nash Equilibria.- Testing Computability by Width Two OBDDs.- Improved Polynomial Identity Testing for Read-Once Formulas.- Smooth Analysis of the Condition Number and the Least Singular Value.
      Hoppa över listan

      Du kanske också är intresserad av

      Jose Rolim, Seffi Naor, Klaus Jansen, Irit Dinur - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, E-bok

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Jose Rolim, Seffi Naor, Klaus Jansen, Irit Dinur

      E-bok
      2009

      1 427 kr

      Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Häftad

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim

      Häftad, 2010

      1 124 kr

      Ashish Goel, Klaus Jansen, José Rolim, Ronitt Rubinfeld - Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, Häftad

      Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

      Ashish Goel, Klaus Jansen, José Rolim, Ronitt Rubinfeld

      Häftad, 2008

      1 124 kr

      Klaus Jansen, Jose Rolim - Approximation Algorithms for Combinatorial Optimization : International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, Övrigt

      Approximation Algorithms for Combinatorial Optimization : International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings

      Klaus Jansen, Jose Rolim

      672 kr

      Klaus Jansen, Jose Rolim - Approximation Algorithms for Combinatorial Optimization, Häftad

      Approximation Algorithms for Combinatorial Optimization

      Klaus Jansen, Jose Rolim

      Häftad, 1998

      566 kr

      Jose Rolim, Klaus Jansen, Ronen Shaltiel, Maria Serna - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, E-bok

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

      Jose Rolim, Klaus Jansen, Ronen Shaltiel, Maria Serna

      E-bok
      2010

      1 413 kr

      Ronitt Rubinfeld, Jose Rolim, Klaus Jansen, Ashish Goel - Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, E-bok

      Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

      Ronitt Rubinfeld, Jose Rolim, Klaus Jansen, Ashish Goel

      E-bok
      2008

      1 413 kr

      Sanguthevar Rajasekaran, Panos M. Pardalos, J.H. Reif, José Rolim - Handbook of Randomized Computing, Häftad

      Handbook of Randomized Computing

      Sanguthevar Rajasekaran, Panos M. Pardalos, J.H. Reif, José Rolim

      Häftad, 2013

      553 kr

      Jose Rolim, Sotiris Nikoletseas - Algorithmic Aspects of Wireless Sensor Networks, E-bok

      Algorithmic Aspects of Wireless Sensor Networks

      Jose Rolim, Sotiris Nikoletseas

      E-bok
      2004

      718 kr

      Sotiris Nikoletseas, Jose Rolim - Algorithmic Aspects of Wireless Sensor Networks, Häftad

      Algorithmic Aspects of Wireless Sensor Networks

      Sotiris Nikoletseas, Jose Rolim

      Häftad, 2004

      566 kr