Pages that link to "Item:Q4210144"
From MaRDI portal
The following pages link to Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144):
Displaying 50 items.
- Consistency thresholds for the planted bisection model (Q287720) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Quantum spectrum testing (Q2231675) (← links)
- Deterministic improved round-trip spanners (Q2410583) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- All-pairs small-stretch paths (Q2729642) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- Approximate Distance Oracles with Improved Bounds (Q2941481) (← links)
- The Power of Dynamic Distance Oracles (Q2941483) (← links)
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (Q2941485) (← links)
- Clustered Integer 3SUM via Additive Combinatorics (Q2941486) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q2941487) (← links)
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) (Q2941488) (← links)
- Proof of the Satisfiability Conjecture for Large k (Q2941489) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q2941491) (← links)
- Sum-of-squares Lower Bounds for Planted Clique (Q2941492) (← links)
- Sum of Squares Lower Bounds from Pairwise Independence (Q2941493) (← links)
- Inapproximability of Combinatorial Problems via Small LPs and SDPs (Q2941494) (← links)
- Preserving Statistical Validity in Adaptive Data Analysis (Q2941495) (← links)
- Local, Private, Efficient Protocols for Succinct Histograms (Q2941496) (← links)
- Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions (Q2941497) (← links)
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (Q2941498) (← links)
- Randomized Composable Core-sets for Distributed Submodular Maximization (Q2941499) (← links)
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation (Q2941504) (← links)
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505) (← links)
- L <sub>p</sub> Row Sampling by Lewis Weights (Q2941506) (← links)
- On the Lovász Theta function for Independent Sets in Sparse Graphs (Q2941507) (← links)
- The Complexity of the Simplex Method (Q2941508) (← links)
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← links)
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (Q2941510) (← links)
- Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (Q2941511) (← links)
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (Q2941512) (← links)
- Almost Optimal Pseudorandom Generators for Spherical Caps (Q2941513) (← links)
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (Q2941514) (← links)
- The List Decoding Radius of Reed-Muller Codes over Small Fields (Q2941515) (← links)
- A Characterization of the Capacity of Online (causal) Binary Channels (Q2941517) (← links)
- Reed-Muller Codes for Random Erasures and Errors (Q2941518) (← links)
- Forrelation (Q2941519) (← links)
- Quantum Information Complexity (Q2941521) (← links)
