Pages that link to "Item:Q3581400"
From MaRDI portal
The following pages link to Universal approximations for TSP, Steiner tree, and set cover (Q3581400):
Displaying 19 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- Algorithms for the universal and a priori TSP (Q924875) (← links)
- Time-communication impossibility results for distributed transactional memory (Q2075626) (← links)
- Load balanced distributed directories (Q2139097) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Universal Guard Problems (Q3177901) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- (Q5743493) (← links)
- (Q5874472) (← links)
- Optimal nearest neighbor queries in sensor networks (Q5899559) (← links)
- Assouad-Nagata dimension and gap for ordered metric spaces (Q6058052) (← links)
- Spaces that can be ordered effectively: virtually free groups and hyperbolicity (Q6163406) (← links)
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces (Q6582315) (← links)
- An improved upper bound for the universal TSP on the grid (Q6621749) (← links)
