The following pages link to (Q4250159):
Displaying 18 items.
- Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- Inventory rebalancing and vehicle routing in bike sharing systems (Q1752898) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- (Q3142820) (← links)
- (Q4736828) (← links)
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees (Q4805401) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Approximation algorithms for the k-source multicast tree construction problem (Q5471088) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901295) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
- Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)
