000 05999nam a22006375i 4500
001 978-3-642-03685-9
003 DE-He213
005 20240730190704.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642036859
_9978-3-642-03685-9
024 7 _a10.1007/978-3-642-03685-9
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
_h[electronic resource] :
_b12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings /
_cedited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXII, 742 p. 41 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5687
505 0 _aContributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich's One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value.
650 0 _aComputer programming.
_94169
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aMathematical statistics.
_99597
650 1 4 _aProgramming Techniques.
_9143498
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aProbability and Statistics in Computer Science.
_931857
700 1 _aDinur, Irit.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9143499
700 1 _aJansen, Klaus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9143500
700 1 _aNaor, Seffi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9143501
700 1 _aRolim, José.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9143502
710 2 _aSpringerLink (Online service)
_9143503
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642036842
776 0 8 _iPrinted edition:
_z9783642036866
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5687
_9143504
856 4 0 _uhttps://doi.org/10.1007/978-3-642-03685-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93393
_d93393