Pages that link to "Item:Q5176178"
From MaRDI portal
The following pages link to Shortest-path queries in static networks (Q5176178):
Displaying 50 items.
- Graphs (Q24208) (← links)
- Consistency thresholds for the planted bisection model (Q287720) (← links)
- Distance oracles for time-dependent networks (Q289929) (← links)
- A lower bound for the quickest path problem (Q337093) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Quantum spectrum testing (Q2231675) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- Computing source-to-target shortest paths for complex networks in RDBMS (Q2402355) (← 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)
- Sparse Quantum Codes from Quantum Circuits (Q2941522) (← links)
- Small Value Parallel Repetition for General Games (Q2941523) (← links)
- An Interactive Information Odometer and Applications (Q2941524) (← links)
- The communication complexity of interleaved group products (Q2941525) (← links)
- Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem (Q2941526) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q2941527) (← links)
