Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings

AvPrasad Raghavendra,Sofya Raskhodnikova

Häftad, Engelska, 2013

Del i serien Lecture Notes in Computer Science

549 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.

Produktinformation

Utgivningsdatum:2013-08-06
Mått:155 x 235 x 40 mm
Vikt:1 089 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:716
Upplaga:2013
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642403279

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

Spectral Sparsification in Dynamic Graph Streams.- The Online Stochastic Generalized Assignment Problem.- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems.- Approximating Large Frequency Moments with Pick-and-Drop Sampling.- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams.- Capacitated Network Design on Undirected Graphs.- Scheduling Subset Tests: One-Time, Continuous, and How They Relate.- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container.- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality.- Online Square-into-Square Packing.- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.- Shrinking Maxima, Decreasing Costs: New Online Packing andCovering Problems.- Multiple Traveling Salesmen in Asymmetric Metrics.- Approximate Indexability and Bandit Problems with Concave Rewardsand Delayed Feedback.- The Approximability of the Binary Paintshop Problem.- Approximation Algorithms for Movement Repairmen.- Improved Hardness of Approximating Chromatic Number.- A Pseudo-approximation for the Genus of Hamiltonian Graphs.- A Local Computation Approximation Scheme to Maximum Matching.- Sketching Earth-Mover Distance on Graph Metrics.- Online Multidimensional Load Balancing.- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs.- Interdiction Problems on Planar Graphs.- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration.- Finding Heavy Hitters from Lossy or Noisy Data.- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2.- Fast Private Data Release Algorithms for Sparse Queries.- Local Reconstructors and Tolerant Testers for Connectivity and Diameter.- An Optimal Lower Bound for Monotonicity Testing over Hypergrids.- Small-Bias Sets for NonabelianGroups: Derandomizations of the Alon-Roichman Theorem.- What You Can Do with Coordinated Samples.- Robust Randomness Amplifiers: Upper and Lower Bounds.- The Power of Choice for Random Satisfiability.- Connectivity of Random High Dimensional Geometric Graphs.- Matching-Vector Families and LDCs over Large Modulo.- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing.- Testing Membership in Counter Automaton Languages.- Tight Lower Bounds for Testing Linear Isomorphism.- Randomness-Efficient Curve Samplers.- Combinatorial Limitations of Average-Radius List Decoding.- Zero Knowledge LTCs and Their Applications.- A Tight Lower Bound for High Frequency Moment Estimation with Small Error.- Improved FPTAS for Multi-spin Systems.- Pseudorandomness for Regular Branching Programs via Fourier Analysis.- Absolutely Sound Testing of Lifted Codes.- On the Average Sensitivity and Density of k-CNF Formulas.- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions.