Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
Uloženo v:
| Další autoři: | |
|---|---|
| Korporace: | |
| Médium: | E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Berlin ; Heidelberg :
Springer Berlin Heidelberg,
2010
|
| Edice: | Lecture Notes in Computer Science
|
| Žánr/forma: | elektronické knihy |
| ISBN: | 978-3-642-15369-3 9783642153686 |
| Témata: | |
| On-line přístup: | Plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| LEADER | 06159nam a22006375i 4500 | ||
|---|---|---|---|
| 001 | 001819545 | ||
| 003 | CZ PrSTK | ||
| 005 | 20151204170504.0 | ||
| 006 | m f d | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100827s2010 gw | s |||| 0|eng d | ||
| 020 | |a 978-3-642-15369-3 |9 9783642153693 | ||
| 024 | 7 | |a 10.1007/978-3-642-15369-3 |2 doi | |
| 040 | |a DE-He213 |b cze |d ABA013 | ||
| 072 | 7 | |a 004 |x Počítačová věda. Výpočetní technika. Informační technologie |2 Konspekt |9 23 | |
| 080 | |a 004 |2 MRF | ||
| 245 | 1 | 0 | |a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : |b 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings / |c edited by Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim |
| 264 | 1 | |a Berlin ; |a Heidelberg : |b Springer Berlin Heidelberg, |c 2010 | |
| 300 | |a 1 online zdroj (XIII, 782 stran) : |b 54 ilustrací | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a počítač |b c |2 rdamedia | ||
| 338 | |a online zdroj |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture Notes in Computer Science, |x 0302-9743 ; |v 6302 | |
| 505 | 0 | |a 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 --- | |
| 505 | 0 | |9 ^^ |a 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 --- | |
| 505 | 0 | |9 ^^ |a 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 --- | |
| 505 | 0 | |9 ^^ |a 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 | |
| 655 | 7 | |a elektronické knihy |7 fd186907 |2 czenas | |
| 659 | 0 | |a Computer science | |
| 659 | 0 | |a Computer communication systems | |
| 659 | 0 | |a Computer programming | |
| 659 | 0 | |a Data structures (Computer science) | |
| 659 | 0 | |a Computers | |
| 659 | 0 | |a Algorithms | |
| 659 | 0 | |a Computer science |x Mathematics | |
| 659 | 1 | 4 | |a Computer Science |
| 659 | 2 | 4 | |a Programming Techniques |
| 659 | 2 | 4 | |a Computer Communication Networks |
| 659 | 2 | 4 | |a Theory of Computation |
| 659 | 2 | 4 | |a Algorithm Analysis and Problem Complexity |
| 659 | 2 | 4 | |a Discrete Mathematics in Computer Science |
| 659 | 2 | 4 | |a Data Structures |
| 650 | 0 | 7 | |a informatika |x if |7 psh6548 |2 psh |
| 650 | 0 | 7 | |a programování |x vt |7 psh12467 |2 psh |
| 650 | 0 | 7 | |a počítače |x vt |7 psh12315 |2 psh |
| 650 | 0 | 7 | |a algoritmizace |x vt |7 psh12472 |2 psh |
| 700 | 1 | |a Serna, Maria |4 edt | |
| 700 | 1 | |a Shaltiel, Ronen |4 edt | |
| 700 | 1 | |a Jansen, Klaus |4 edt | |
| 700 | 1 | |a Rolim, José |4 edt | |
| 710 | 2 | |a SpringerLink (online služba) |7 ntk2018999494 | |
| 776 | 0 | 8 | |i Tištěné vydání: |t Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings |z 9783642153686 |
| 830 | 0 | |a Lecture Notes in Computer Science | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-15369-3 |y Plný text |
| 910 | |a ABA013 | ||
| 950 | |a Springer |b Lecture Notes in Computer Science 2017 | ||