The following pages link to Mohammad R. Salavatipour (Q247905):
Displaying 50 items.
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- On minimum sum of radii and diameters clustering (Q494937) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- Approximability of packing disjoint cycles (Q534781) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- (Q1567292) (redirect page) (← links)
- On a conjecture of Keedwell and the cycle double cover conjecture (Q1567293) (← links)
- Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← links)
- Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment (Q2165027) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Large induced forests in triangle-free planar graphs (Q2494123) (← links)
- Asymmetric Traveling Salesman Path and Directed Latency Problems (Q2862204) (← links)
- On Minimum Sum of Radii and Diameters Clustering (Q2904544) (← links)
- New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem (Q2904560) (← links)
- (Q2934722) (← links)
- Approximation Algorithms for Minimum-Load k-Facility Location (Q2969039) (← links)
- Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design (Q3053149) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph (Q3104595) (← links)
- Minimizing movement in mobile facility location problems (Q3189010) (← links)
- Combination Can Be Hard: Approximability of the Unique Coverage Problem (Q3395040) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
- Two-Stage Robust Network Design with Exponential Scenarios (Q3541119) (← links)
- Survivable network design with degree or order constraints (Q3549666) (← links)
- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs (Q3569890) (← links)
- Survivable Network Design with Degree or Order Constraints (Q3575159) (← links)
- Combination can be hard (Q3581529) (← links)
- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees (Q3595372) (← links)
- Disjoint Cycles: Integrality Gap, Hardness, and Approximation (Q3596365) (← links)
- (Q4471317) (← links)
- Approximation Algorithms for Minimum-Load <i>k</i> -Facility Location (Q4554343) (← links)
- (Q4607905) (← links)
- (Q4633882) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. (Q4636540) (← links)
- A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) (← links)
- Packing element-disjoint steiner trees (Q4962687) (← links)
- Approximation algorithms and hardness results for cycle packing problems (Q4962688) (← links)
- Approximation Schemes for Clustering with Outliers (Q4972668) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
