Pages that link to "Item:Q1196368"
From MaRDI portal
The following pages link to On sparse spanners of weighted graphs (Q1196368):
Displaying 50 items.
- Quantum spectrum testing (Q2231675) (← links)
- Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Geometric spanner games (Q2330124) (← links)
- Fault tolerant additive and \((\mu, \alpha)\)-spanners (Q2344775) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Terminal embeddings (Q2405893) (← links)
- Deterministic improved round-trip spanners (Q2410583) (← links)
- On certain geometric properties of the Yao-Yao graphs (Q2436661) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- Near isometric terminal embeddings for doubling metrics (Q2665904) (← links)
- Self-stabilizing spanner topology control solutions in wireless ad hoc networks (Q2672602) (← links)
- On path-greedy geometric spanners (Q2678257) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← 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)
