Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Record no. 112628)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06467nam a22005895i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-642-15369-3 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20140220084545.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 100827s2010 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642153693 |
| -- | 978-3-642-15369-3 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-15369-3 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.9.A43 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UMB |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM051300 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Serna, Maria. |
| Relator term | editor. |
| 245 10 - TITLE STATEMENT | |
| Title | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques |
| Medium | [electronic resource] : |
| Remainder of title | 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings / |
| Statement of responsibility, etc | edited by Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 2010. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XIII, 782p. 54 illus. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| International Standard Serial Number | 0302-9743 ; |
| Volume number/sequential designation | 6302 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Contributed Talks of APPROX -- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem -- Improved Inapproximability for Submodular Maximization -- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems -- Submodular Secretary Problem and Extensions -- Approximation Algorithms for Min-Max Generalization Problems -- Min-Power Strong Connectivity -- The Complexity of Approximately Counting Stable Matchings -- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs -- Approximating Linear Threshold Predicates -- Approximating Sparsest Cut in Graphs of Bounded Treewidth -- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors -- Vertex Sparsifiers: New Results from Old Techniques -- PTAS for Weighted Set Cover on Unit Squares -- Improved Lower Bounds for the Universal and a priori TSP -- Proximity Algorithms for Nearly-Doubling Spaces -- Matrix Sparsification and the Sparse Null Space Problem -- The Checkpoint Problem -- The Euclidean Distortion of Flat Tori -- Online Embeddings -- Approximation Algorithms for Intersection Graphs -- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs -- Improved Algorithm for the Half-Disjoint Paths Problem -- Approximate Lasserre Integrality Gap for Unique Games -- Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses -- Maximum Flows on Disjoint Paths -- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization -- How to Schedule When You Have to Buy Your Energy -- Improving Integrality Gaps via Chvátal-Gomory Rounding -- Contributed Talks of RANDOM -- Uniform Derandomization from Pathetic Lower Bounds -- Testing Boolean Function Isomorphism -- Better Size Estimation for Sparse Matrix Products -- Low Rate Is Insufficient for Local Testability -- Reconstruction Threshold for the Hardcore Model -- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners -- Monotonicity Testing and Shortest-Path Routing on the Cube -- Better Gap-Hamming Lower Bounds via Better Round Elimination -- Propagation Connectivity of Random Hypergraphs -- Improved Pseudorandom Generators for Depth 2 Circuits -- The Structure of Winning Strategies in Parallel Repetition Games -- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries -- Periodicity in Streams -- Rumor Spreading on Random Regular Graphs and Expanders -- On Testing Computability by Small Width OBDDs -- Learning and Lower Bounds for AC 0 with Threshold Gates -- Liftings of Tree-Structured Markov Chains -- Constructive Proofs of Concentration Bounds -- Almost-Euclidean Subspaces of via Tensor Products: A Simple Approach to Randomness Reduction -- Testing Outerplanarity of Bounded Degree Graphs -- Two-Source Extractors Secure against Quantum Adversaries -- Locally Testable vs. Locally Decodable Codes -- Differential Privacy and the Fat-Shattering Dimension of Linear Queries -- Two Theorems on List Decoding -- Delaying Satisfiability for Random 2SAT -- Improved Rounding for Parallel Repeated Unique Games -- A Query Efficient Non-adaptive Long Code Test with Perfect Completeness -- Relativized Worlds without Worst-Case to Average-Case Reductions for NP -- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book constitutes the joint refereed proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010, and the 14th International Workshop on Randomization and Computation, RANDOM 2010, held in Barcelona, Spain, in September 2010. The 28 revised full papers of the APPROX 2010 workshop and the 29 revised full papers of the RANDOM 2010 workshop included in this volume, were carefully reviewed and selected from 66 and 61 submissions, respectively. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Communication Networks. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data structures (Computer science). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer software. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computational complexity. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer graphics. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete Mathematics in Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data Structures. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computation by Abstract Devices. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Graphics. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Communication Networks. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Shaltiel, Ronen. |
| Relator term | editor. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Jansen, Klaus. |
| Relator term | editor. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Rolim, José. |
| Relator term | editor. |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783642153686 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 0302-9743 ; |
| Volume number/sequential designation | 6302 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-642-15369-3 |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.