Foto 1 di 1
Foto 1 di 1
Approssimazione, randomizzazione e ottimizzazione combinatoria. Algoritmi e tecnologia-
US $124,10
CircaEUR 111,29
Condizione:
Nuovo
Libro nuovo, intatto e non letto, in perfette condizioni, senza pagine mancanti o danneggiate. Per maggiori dettagli, consulta l'inserzione del venditore.
3 disponibili
- Compralo SubitoApprossimazione, randomizzazione e ottimizzazione combinatoria. Algoritmi e tecnologia
Spedizione:
Gratis Economy Shipping.
Oggetto che si trova a: Fairfield, Ohio, Stati Uniti
Consegna:
Consegna prevista tra il mer 9 ott e il mer 16 ott a 43230
Restituzioni:
Restituzioni entro 30 giorni. Le spese di spedizione del reso sono a carico dell'acquirente.
Pagamenti:
Fai shopping in tutta sicurezza
Il venditore si assume la piena responsabilità della messa in vendita dell'oggetto.
Numero oggetto eBay:364686935938
Specifiche dell'oggetto
- Condizione
- ISBN-13
- 9783540853626
- Book Title
- Approximation, Randomization and Combinatorial Optimization. Algo
- ISBN
- 9783540853626
- Subject Area
- Computers
- Publication Name
- Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques : 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 2008 - Proceeding
- Publisher
- Springer Berlin / Heidelberg
- Item Length
- 9.3 in
- Subject
- Programming / General, Programming / Algorithms, Computer Science
- Publication Year
- 2008
- Series
- Lecture Notes in Computer Science Ser.
- Type
- Textbook
- Format
- Trade Paperback
- Language
- English
- Item Weight
- 33.1 Oz
- Item Width
- 6.1 in
- Number of Pages
- Xii, 604 Pages
Informazioni su questo prodotto
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3540853626
ISBN-13
9783540853626
eBay Product ID (ePID)
70899752
Product Key Features
Number of Pages
Xii, 604 Pages
Language
English
Publication Name
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques : 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 2008 - Proceeding
Subject
Programming / General, Programming / Algorithms, Computer Science
Publication Year
2008
Type
Textbook
Subject Area
Computers
Series
Lecture Notes in Computer Science Ser.
Format
Trade Paperback
Dimensions
Item Weight
33.1 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
Series Volume Number
5171
Number of Volumes
1 vol.
Illustrated
Yes
Table Of Content
Contributed Talks of APPROX.- Approximating Optimal Binary Decision Trees.- Santa Claus Meets Hypergraph Matchings.- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.- Connected Vertex Covers in Dense Graphs.- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies.- Sweeping Points.- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness.- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP.- Approximating Maximum Subgraphs without Short Cycles.- Deterministic 7/8-Approximation for the Metric Maximum TSP.- Inapproximability of Survivable Networks.- Approximating Single Machine Scheduling with Scenarios.- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity.- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.- The Directed Minimum Latency Problem.- A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem.- Approximating Directed Weighted-Degree Constrained Networks.- A Constant Factor Approximation for Minimum ?-Edge-Connected k-Subgraph with Metric Costs.- Budgeted Allocations in the Full-Information Setting.- Contributed Talks of RANDOM.- Optimal Random Matchings on Trees and Applications.- Small Sample Spaces Cannot Fool Low Degree Polynomials.- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.- Tensor Products of Weakly Smooth Codes Are Robust.- On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.- Improved Bounds for Testing Juntas.- The Complexity of Distinguishing MarkovRandom Fields.- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms.- Tight Bounds for Hashing Block Sources.- Improved Separations between Nondeterministic and Randomized Multiparty Communication.- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs.- On the Query Complexity of Testing Orientations for Being Eulerian.- Approximately Counting Embeddings into Random Graphs.- Increasing the Output Length of Zero-Error Dispersers.- Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals.- The Complexity of Local List Decoding.- Limitations of Hardness vs. Randomness under Uniform Reductions.- Learning Random Monotone DNF.- Breaking the ?-Soundness Bound of the Linearity Test over GF(2).- Dense Fast Random Projections and Lean Walsh Transforms.- Near Optimal Dimensionality Reductions That Preserve Volumes.- Sampling Hypersurfaces through Diffusion.- A 2-Source Almost-Extractor for Linear Entropy.- Extractors for Three Uneven-Length Sources.- The Power of Choice in a Generalized Pólya Urn Model.- Corruption and Recovery-Efficient Locally Decodable Codes.- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets.
Synopsis
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., 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., 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.
LC Classification Number
QA76.6-76.66
Descrizione dell'oggetto fatta dal venditore
Informazioni sul venditore professionale
Premier Books LLC
David Taylor
26C Trolley Sq
19806-3356 Wilmington, DE
United States
Certifico che tutte le mie attività di vendita saranno conformi alle leggi e ai regolamenti dell'Unione Europea.
Categorie più popolari di questo Negozio
Registrato come venditore professionale
Feedback del venditore (1.032.861)
- l***c (227)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoBook came packaged well to avoid damage, in great condition. Not sure if the seller delayed shipping or if usps didn’t update the shipping, which is highly likely. Still received and we are happy with our purchase. I had trouble looking up tracking due to the company they used but seller found usps tracking and sent that over quickly. Sellers communication was excellent. Would buy from again. Item as described.
- t***n (2908)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoI don't give negatives; However, description was not correct; No price guide was included in this book.As you will see in book pic shown; title states price guide included, no price guide inside. Communication poor, description, no communication price guide missing from this book. Shipping time was weeks before it was even shipped. Blamed the shipping on warehouse. You own & operate a business; your warehouse is not up to standards you change who you do business with. It's your responsibility.
- -***6 (133)- Feedback lasciato dall'acquirente.Ultimi 6 mesiAcquisto verificatoItem arrived as described and adequately packaged. Ridiculously long shipping time. Seller posts incorrect tracking number and lists the item as shipped. Contacted seller for correct tracking, received a new tracking number with the warning that the number won’t be “live” until the item is shipped. Will you get your item? Yeah, probably. Count on it being delivered 2-3 weeks longer than expected.