The following pages link to Aparna Das (Q494935):
Displayed 9 items.
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- On hierarchical diameter-clustering and the supplier problem (Q839643) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Approximating the Generalized Minimum Manhattan Network Problem (Q2872136) (← links)
- The Train Delivery Problem - Vehicle Routing Meets Bin Packing (Q3075453) (← links)
- (Q5417633) (← links)
- On Hierarchical Diameter-Clustering, and the Supplier Problem (Q5443515) (← links)
- On Maximum Differential Coloring of Planar Graphs (Q6239969) (← links)