Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313029
DOI10.1007/b99805zbMath1105.68460OpenAlexW4301133941MaRDI QIDQ5313029
Robert Krauthgamer, Ravi Kumar, Ziv Bar-Yossef, T. S. Jayram
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99805
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity, Unnamed Item, Lower Bounds for Testing Computability by Small Width OBDDs, Sparse Recovery with Partial Support Knowledge, Everywhere-Tight Information Cost Tradeoffs for Augmented Index, Quasi-Periodicity in Streams, Optimal lower bounds for matching and vertex cover in dynamic graph streams
