Pages that link to "Item:Q2851843"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q2851843):
Displayed 50 items.
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Clustering in Interfering Binary Mixtures (Q3088134) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- Query Complexity in Errorless Hardness Amplification (Q3088136) (← links)
- A New Point of NP-Hardness for 2-to-1 Label Cover (Q3167380) (← links)
- Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems (Q3167381) (← links)
- Additive Approximation for Near-Perfect Phylogeny Construction (Q3167382) (← links)
- Improved Spectral-Norm Bounds for Clustering (Q3167383) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs (Q3167384) (← links)
- What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid (Q3167385) (← links)
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply (Q3167386) (← links)
- Online Flow Time Scheduling in the Presence of Preemption Overhead (Q3167387) (← links)
- Prize-Collecting Survivable Network Design in Node-Weighted Graphs (Q3167388) (← links)
- Approximating Minimum-Cost Connected T-Joins (Q3167389) (← links)
- iBGP and Constrained Connectivity (Q3167390) (← links)
- Online Scheduling of Jobs with Fixed Start Times on Related Machines (Q3167391) (← links)
- Approximating Bounded Occurrence Ordering CSPs (Q3167393) (← links)
- On the NP-Hardness of Max-Not-2 (Q3167394) (← links)
- The Remote Set Problem on Lattices (Q3167395) (← links)
- Approximation Algorithms for Generalized and Variable-Sized Bin Covering (Q3167396) (← links)
- Approximating Minimum Linear Ordering Problems (Q3167397) (← links)
- New Approximation Results for Resource Replication Problems (Q3167398) (← links)
- Maximum Matching in Semi-streaming with Few Passes (Q3167399) (← links)
- Improved Inapproximability for TSP (Q3167400) (← links)
- Approximation Algorithm for Non-boolean MAX k-CSP (Q3167401) (← links)
- Planarizing an Unknown Surface (Q3167402) (← links)
- The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover (Q3167403) (← links)
- New and Improved Bounds for the Minimum Set Cover Problem (Q3167404) (← links)
- Hardness of Vertex Deletion and Project Scheduling (Q3167405) (← links)
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q3167406) (← links)
- Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four (Q3167407) (← links)
- Spectral Norm of Symmetric Functions (Q3167408) (← links)
- Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions (Q3167409) (← links)
- Testing Permanent Oracles – Revisited (Q3167410) (← links)
- Testing Lipschitz Functions on Hypergrid Domains (Q3167411) (← links)
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic (Q3167412) (← links)
- Multiple-Choice Balanced Allocation in (Almost) Parallel (Q3167413) (← links)
- Optimal Hitting Sets for Combinatorial Shapes (Q3167414) (← links)
- Tight Bounds for Testing k-Linearity (Q3167415) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- On the Coin Weighing Problem with the Presence of Noise (Q3167418) (← links)
- Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming (Q3167419) (← links)
- An Explicit VC-Theorem for Low-Degree Polynomials (Q3167420) (← links)
- Tight Bounds on the Threshold for Permuted k-Colorability (Q3167422) (← links)
- Sparse and Lopsided Set Disjointness via Information Theory (Q3167423) (← links)
- Rainbow Connectivity of Sparse Random Graphs (Q3167424) (← links)
- Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors (Q3167425) (← links)
- Two-Sided Error Proximity Oblivious Testing (Q3167426) (← links)
- Mirror Descent Based Database Privacy (Q3167427) (← links)