Author image not provided
 Ashkan Norouzi-Fard

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.60
Citation Count3
Publication count5
Publication years2013-2017
Available for download3
Average downloads per article46.00
Downloads (cumulative)138
Downloads (12 Months)88
Downloads (6 Weeks)11
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


5 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 5 of 5
Sort by:

1 published by ACM
February 2017 ACM Transactions on Algorithms (TALG) - Special Issue on SODA'15 and Regular Papers: Volume 13 Issue 2, May 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 76,   Downloads (Overall): 76

Full text available: PDFPDF
The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance metric between clients and facilities changes over time. This leads to a trade-off between optimizing ...
Keywords: approximation algorithms, exponential clocks, Facility location problems

2
December 2016 NIPS'16: Proceedings of the 30th International Conference on Neural Information Processing Systems
Publisher: Curran Associates Inc.
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 2,   Downloads (Overall): 2

Full text available: PDFPDF
We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream will fail to provide any non-trivial approximation ...

3
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Downloads (Overall): 60

Full text available: PDFPDF
The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance metric between clients and facilities changes over time. This leads to a trade-off between optimizing ...
Keywords: approximation algorithms, exponential clocks, facility location problems

4
December 2014 Algorithmica: Volume 70 Issue 4, December 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

We revisit the problem of finding $$k$$k paths with a minimum number of shared edges between two vertices of a graph. An edge is called shared if it is used in more than one of the $$k$$k paths. We provide a $${\lfloor {k/2}\rfloor }$$�k/2�-approximation algorithm for this problem, improving the ...
Keywords: Approximation algorithms, Shared edges, Inapproximability, Network design

5
March 2013 WAINA '13: Proceedings of the 2013 27th International Conference on Advanced Information Networking and Applications Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

Mobile ad hoc networks (MANETs) have become very interesting during last years, but the security is the most important problem they suffer from. Asymmetric cryptography is a very useful solution to provide a secure environment in multihop networks where intermediate nodes are able to read, drop or change messages before ...
Keywords: Asymmetric Cryptography, Connectivity, Large Scale MANETs, Probabilistic Key Management



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us