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.
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Online square-into-square packing (Q521815) (← links)
- On the total perimeter of homothetic convex bodies in a convex container (Q747571) (← links)
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
- Better size estimation for sparse matrix products (Q2249750) (← links)
- Spectral Sparsification in Dynamic Graph Streams (Q2851844) (← links)
- The Online Stochastic Generalized Assignment Problem (Q2851845) (← links)
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846) (← links)
- Approximating Large Frequency Moments with Pick-and-Drop Sampling (Q2851847) (← links)
- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams (Q2851848) (← links)
- Capacitated Network Design on Undirected Graphs (Q2851849) (← links)
- Scheduling Subset Tests: One-Time, Continuous, and How They Relate (Q2851850) (← links)
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality (Q2851852) (← links)
- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions (Q2851854) (← links)
- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems (Q2851855) (← links)
- Multiple Traveling Salesmen in Asymmetric Metrics (Q2851856) (← links)
- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback (Q2851857) (← links)
- The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
- Approximation Algorithms for Movement Repairmen (Q2851859) (← links)
- Improved Hardness of Approximating Chromatic Number (Q2851860) (← links)
- A Pseudo-approximation for the Genus of Hamiltonian Graphs (Q2851861) (← links)
- A Local Computation Approximation Scheme to Maximum Matching (Q2851862) (← links)
- Sketching Earth-Mover Distance on Graph Metrics (Q2851863) (← links)
- Online Multidimensional Load Balancing (Q2851864) (← links)
- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs (Q2851865) (← links)
- Interdiction Problems on Planar Graphs (Q2851866) (← links)
- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration (Q2851867) (← links)
- Finding Heavy Hitters from Lossy or Noisy Data (Q2851870) (← links)
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy (Q2851871) (← links)
- Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2 (Q2851872) (← links)
- Fast Private Data Release Algorithms for Sparse Queries (Q2851873) (← links)
- Local Reconstructors and Tolerant Testers for Connectivity and Diameter (Q2851874) (← links)
- An Optimal Lower Bound for Monotonicity Testing over Hypergrids (Q2851875) (← links)
- Small-Bias Sets for Nonabelian Groups (Q2851876) (← links)
- What You Can Do with Coordinated Samples (Q2851877) (← links)
- Robust Randomness Amplifiers: Upper and Lower Bounds (Q2851878) (← links)
- The Power of Choice for Random Satisfiability (Q2851879) (← links)
- Connectivity of Random High Dimensional Geometric Graphs (Q2851881) (← links)
- Matching-Vector Families and LDCs over Large Modulo (Q2851882) (← links)
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing (Q2851883) (← links)
- Testing Membership in Counter Automaton Languages (Q2851885) (← links)
- Tight Lower Bounds for Testing Linear Isomorphism (Q2851886) (← links)
- Randomness-Efficient Curve Samplers (Q2851887) (← links)
- Combinatorial Limitations of Average-Radius List Decoding (Q2851888) (← links)
- Zero Knowledge LTCs and Their Applications (Q2851889) (← links)
- A Tight Lower Bound for High Frequency Moment Estimation with Small Error (Q2851890) (← links)
- Improved FPTAS for Multi-spin Systems (Q2851891) (← links)
- Pseudorandomness for Regular Branching Programs via Fourier Analysis (Q2851892) (← links)
- Absolutely Sound Testing of Lifted Codes (Q2851893) (← links)