default search action
Mohsen Rezapour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour
:
Approximation schemes for Min-Sum k-Clustering. Discret. Optim. 54: 100860 (2024) - [i3]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun:
A QPTAS for Facility Location on Unit Disk graphs. CoRR abs/2405.08931 (2024) - 2023
- [j14]Bahareh Afhami, Mohsen Rezapour, Mohsen Madadi, Vahed Maroufy:
A comonotonic approximation to optimal terminal wealth under a multivariate Merton model with correlated jump risk. Appl. Math. Comput. 444: 127808 (2023) - [j13]Hossein Jowhari
Monochromatic partitioning of colored points by lines. Inf. Process. Lett. 182: 106402 (2023) - [c7]Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Min-Sum k-Clustering. ESA 2023: 84:1-84:16 - 2020
- [j12]Saeed Ariyafar, Mahbanoo Tata, Mohsen Rezapour, Mohsen Madadi
Comparison of aggregation, minimum and maximum of two risky portfolios with dependent claims. J. Multivar. Anal. 178: 104620 (2020)
2010 – 2019
- 2019
- [j11]Zachary Friggstad, Mohsen Rezapour
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. Algorithmica 81(3): 1075-1095 (2019) - [j10]Zachary Friggstad
Scheduling problems over a network of machines. J. Sched. 22(2): 239-253 (2019) - [j9]Zachary Friggstad, Mohsen Rezapour
Local Search Yields a PTAS for k-Means in Doubling Metrics. SIAM J. Comput. 48(2): 452-480 (2019) - [j8]Zachary Friggstad, Kamyar Khodamoradi
Approximation Schemes for Clustering with Outliers. ACM Trans. Algorithms 15(2): 26:1-26:26 (2019) - 2018
- [c6]Zachary Friggstad, Kamyar Khodamoradi
Approximation Schemes for Clustering with Outliers. SODA 2018: 398-414 - 2017
- [j7]Ashwin Arulselvan
Exact Approaches for Designing Multifacility Buy-at-Bulk Networks. INFORMS J. Comput. 29(4): 597-611 (2017) - [c5]Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi
Scheduling Problems over Network of Machines. APPROX-RANDOM 2017: 5:1-5:18 - [i2]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. CoRR abs/1707.04295 (2017) - 2016
- [j6]Andreas Bley
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems. Discret. Appl. Math. 213: 34-46 (2016) - [c4]Zachary Friggstad, Mohsen Rezapour
Local Search Yields a PTAS for k-Means in Doubling Metrics. FOCS 2016: 365-374 - [c3]Zachary Friggstad, Mohsen Rezapour
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. SWAT 2016: 1:1-1:14 - [i1]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Local Search Yields a PTAS for k-Means in Doubling Metrics. CoRR abs/1603.08976 (2016) - 2015
- [c2]Zachary Friggstad, Mohsen Rezapour
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. WADS 2015: 373-385 - 2014
- [j5]Mohsen Rezapour, Mohammad Hossein Alamatsaz:
Stochastic comparison of lifetimes of two (n-k+1)-out-of-n systems with heterogeneous dependent components. J. Multivar. Anal. 130: 240-251 (2014) - 2013
- [j4]Andreas Bley
IP modeling of the survivable hop constrained connected facility location problem. Electron. Notes Discret. Math. 41: 463-470 (2013) - [j3]Andreas Bley
Approximating connected facility location with buy-at-bulk edge costs via random sampling. Electron. Notes Discret. Math. 44: 313-319 (2013) - [c1]Andreas Bley
Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem. TAMC 2013: 72-83
2000 – 2009
- 2008
- [j2]S. Mehdi Hashemi, Ahmad Moradi
An ACO algorithm to design UMTS access network using divided and conquer technique. Eng. Appl. Artif. Intell. 21(6): 931-940 (2008) - 2007
- [j1]S. Mehdi Hashemi, Mohsen Rezapour
Two new algorithms for the Min-Power Broadcast problem in static ad hoc networks. Appl. Math. Comput. 190(2): 1657-1668 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: