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.
- On the Average Sensitivity and Density of k-CNF Formulas (Q2851894) (← links)
- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions (Q2851895) (← links)
- Improved inapproximability results for counting independent sets in the hard-core model (Q2877770) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
- O(1)-Approximations for Maximum Movement Problems (Q3088082) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← links)
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem (Q3088086) (← links)
- Scheduling Resources for Throughput Maximization (Q3088087) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q3088089) (← links)
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
- Periodicity and Cyclic Shifts via Linear Sketches (Q3088091) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- Opaque Sets (Q3088094) (← links)
- Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
- Satisfying Degree-d Equations over GF[2] n (Q3088098) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- Network-Design with Degree Constraints (Q3088102) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Viral Processes by Random Walks on Random Regular Graphs (Q3088107) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- The Computational Complexity of Estimating MCMC Convergence Time (Q3088115) (← links)
- Streaming Algorithms with One-Sided Estimation (Q3088116) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- A Canonical Form for Testing Boolean Function Properties (Q3088118) (← links)
- Independent Sets in Random Graphs from the Weighted Second Moment Method (Q3088119) (← links)
- A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (Q3088120) (← links)
- Dense Locally Testable Codes Cannot Have Constant Rate and Distance (Q3088121) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) (← links)
- Inflatable Graph Properties and Natural Property Tests (Q3088125) (← links)
- Fast Simulation of Large-Scale Growth Models (Q3088126) (← links)
- Optimal Rate List Decoding via Derivative Codes (Q3088129) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- On Sampling from Multivariate Distributions (Q3088131) (← links)