The following pages link to (Q4542533):
Displaying 50 items.
- Discrete and continuous models for partitioning problems (Q2254249) (← links)
- Online and offline algorithms for the sorting buffers problem on the line metric (Q2266935) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
- Some results on metric trees (Q3068725) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- Recognition of Tree Metrics (Q4205451) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- Multifacility ordered median problems on networks: A further analysis (Q4797942) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- (Q5009578) (← links)
- Lossless Prioritized Embeddings (Q5088604) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479364) (← links)
- A randomized on–line algorithm for the <i>k</i>–server problem on a line (Q5486309) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5901089) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
- The \(k\)-centrum multi-facility location problem (Q5931794) (← links)
- On dominated \(\ell_1\) metrics (Q5939287) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- Stochastic approximation of lamplighter metrics (Q6048880) (← links)
- Reliable Spanners for Metric Spaces (Q6075742) (← links)
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case (Q6130232) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
- Piecewise integrable neural network: an interpretable chaos identification framework (Q6572660) (← links)
- Improved lower bound for differentially private facility location (Q6602319) (← links)
