Mohsen Rezapour

Orcid: 0000-0001-9648-8394

According to our database1, Mohsen Rezapour authored at least 18 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximation schemes for Min-Sum k-Clustering.
Discret. Optim., 2024

A QPTAS for Facility Location on Unit Disk graphs.
CoRR, 2024

2023
Monochromatic partitioning of colored points by lines.
Inf. Process. Lett., August, 2023

A comonotonic approximation to optimal terminal wealth under a multivariate Merton model with correlated jump risk.
Appl. Math. Comput., May, 2023

2020
Comparison of aggregation, minimum and maximum of two risky portfolios with dependent claims.
J. Multivar. Anal., 2020

2019
Approximation Schemes for Clustering with Outliers.
ACM Trans. Algorithms, 2019

Local Search Yields a PTAS for k-Means in Doubling Metrics.
SIAM J. Comput., 2019

Scheduling problems over a network of machines.
J. Sched., 2019

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.
Algorithmica, 2019

2017
Exact Approaches for Designing Multifacility Buy-at-Bulk Networks.
INFORMS J. Comput., 2017

2016
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems.
Discret. Appl. Math., 2016

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2014
Stochastic comparison of lifetimes of two (n-k+1)-out-of-n systems with heterogeneous dependent components.
J. Multivar. Anal., 2014

2013
Approximating connected facility location with buy-at-bulk edge costs via random sampling.
Electron. Notes Discret. Math., 2013

IP modeling of the survivable hop constrained connected facility location problem.
Electron. Notes Discret. Math., 2013

Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem.
Proceedings of the Theory and Applications of Models of Computation, 2013

2008
An ACO algorithm to design UMTS access network using divided and conquer technique.
Eng. Appl. Artif. Intell., 2008

2007
Two new algorithms for the Min-Power Broadcast problem in static ad hoc networks.
Appl. Math. Comput., 2007


  Loading...