9783540853626 - approximation, randomization and combinatorial optimization. algorithms and techniques: 11th international workshop, approx 2008 and 12th ... notes in computer science, 5171, band 5171) (8 Ergebnisse)
- Softcover
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USARomtrade Corp.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 76,58
Versand nach gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
- Softcover
Anbieter: Majestic Books, Hounslow, , Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht
EUR 102,62
EUR 7,51 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Zustand: Used. pp. 622 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
- Softcover
Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht
EUR 104,67
EUR 9,95 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Zustand: Used. pp. 622.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 120,84
EUR 13,85 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
Weitere Bilder- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 95,70
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008 | Ashish Goel (u. a.) | Taschenbuch | xii | Englisch | 2008 | Springer | EAN 9783540853626…| Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Softcover
Anbieter: Revaluation Books, Exeter, , Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 158,33
EUR 14,45 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Paperback. Zustand: Brand New. 1st edition. 604 pages. 9.00x6.00x1.25 inches. In Stock.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 106,99
EUR 64,63 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 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which t…ook place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25-27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e cient approximate solutions to computationally di cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes,average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.
- Softcover
Anbieter: Buchpark, Trebbin, , DeutschlandBuchpark
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Sehr gut
EUR 67,15
EUR 105,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 620 | Sprache: Englisch | Produktart: Bücher | This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM…2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25¿27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ¿cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes,average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.
