Chekuri chandra (15 Ergebnisse)
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 8th International Workshop on Approximation Algorithms for . Computer Science and General Issues)
Chekuri, Chandra [Editor]; Jansen, Klaus [Editor]; Rolim, José D.P. [Editor]; Trevisan, Luca [Editor];
- Softcover
Anbieter: GuthrieBooks, Spring Branch, TX, USAGuthrieBooks
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 42,74
EUR 6,15 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Paperback. Zustand: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 60,73
EUR 13,91 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
Approximation, Randomization And Combinatorial Optimization : Algorithms and Techniques
Chekuri, Chandra (EDT); Jansen, Klaus (EDT); Rolim, Jose D. P. (EDT); Trevisan, Luca (EDT)
- Softcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 74,54
EUR 2,32 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
Approximation, Randomization And Combinatorial Optimization : Algorithms and Techniques
Chekuri, Chandra (EDT); Jansen, Klaus (EDT); Rolim, Jose D. P. (EDT); Trevisan, Luca (EDT)
- Softcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 60,72
EUR 17,41 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Softcover
Anbieter: online-buch-de, Dozwil, Schweizonline-buch-de
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 46,55
EUR 36,00 VersandVersand von Schweiz nach USAAnzahl: 1 verfügbar
Paperback Jun 13, 2008. Zustand: gebraucht; wie neu. ungebraucht, evtl. minimalste Lagerspuren.
Approximation, Randomization And Combinatorial Optimization : Algorithms and Techniques
Chekuri, Chandra (EDT); Jansen, Klaus (EDT); Rolim, Jose D. P. (EDT); Trevisan, Luca (EDT)
- Softcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 84,00
EUR 2,32 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
- Softcover
Anbieter: Books Puddle, New York, NY, USABooks Puddle
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 85,01
EUR 3,51 VersandVersand innerhalb von USAAnzahl: 4 verfügbar
Zustand: New. pp. 512.
Approximation, Randomization And Combinatorial Optimization : Algorithms and Techniques
Chekuri, Chandra (EDT); Jansen, Klaus (EDT); Rolim, Jose D. P. (EDT); Trevisan, Luca (EDT)
- Softcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 79,30
EUR 17,41 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Chekuri, Chandra|Jansen, Klaus|Rolim, José D. P.|Trevisan, Luca
- Softcover
Anbieter: moluna, Greven, Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 48,37
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,49
EUR 63,84 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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),whichtookpla…ceconcurrentlyattheUniversity 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.
Weitere Bilder- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 50,35
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. 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 | Chandra Chekuri (u. a.) | Taschenbuch | xi | Englisch | 2005 | Springer | EAN 9783540282396 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,49
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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(RANDOM20…05),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. 512 pp. Englisch.
- Softcover
- Print-on-Demand
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 85,48
EUR 7,54 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
Zustand: New. Print on Demand pp. 512 Illus.
- Softcover
- Print-on-Demand
Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 83,31
EUR 9,95 VersandVersand von Deutschland nach USAAnzahl: 4 verfügbar
Zustand: New. PRINT ON DEMAND pp. 512.
- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,49
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 MAXCUT.- 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 512 pp. Englisch.
