Disaster resilience of optical networks: State of the art, challenges, and opportunities

J Rak, R Girão-Silva, T Gomes, G Ellinas… - Optical Switching and …, 2021 - Elsevier
For several decades, optical networks, due to their high capacity and long-distance
transmission range, have been used as the major communication technology to serve …

[图书][B] The algorithm design manual

SS Skiena - 1998 - Springer
This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

[图书][B] Lectures on discrete geometry

J Matousek - 2013 - books.google.com
This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

Designing fair ranking schemes

A Asudeh, HV Jagadish, J Stoyanovich… - Proceedings of the 2019 …, 2019 - dl.acm.org
Items from a database are often ranked based on a combination of criteria. The weight given
to each criterion in the combination can greatly affect the fairness of the produced ranking …

The coverage problem in a wireless sensor network

CF Huang, YC Tseng - Proceedings of the 2nd ACM international …, 2003 - dl.acm.org
One fundamental issue in sensor networks is the coverage problem, which reflects how well
a sensor network is monitored or tracked by sensors. In this paper, we formulate this …

Approximating extent measures of points

PK Agarwal, S Har-Peled, KR Varadarajan - Journal of the ACM (JACM), 2004 - dl.acm.org
We present a general technique for approximating various descriptors of the extent of a set P
of n points in R d when the dimension d is an arbitrary fixed constant. For a given extent …

[PDF][PDF] Geometric Shortest Paths and Network Optimization.

JSB Mitchell - Handbook of computational geometry, 2000 - Citeseer
A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

The resilience of WDM networks to probabilistic geographical failures

PK Agarwal, A Efrat, SK Ganjugunte… - IEEE/ACM …, 2013 - ieeexplore.ieee.org
Telecommunications networks, and in particular optical WDM networks, are vulnerable to
large-scale failures in their physical infrastructure, resulting from physical attacks (such as …

Computing the discrete Fréchet distance in subquadratic time

PK Agarwal, RB Avraham, H Kaplan, M Sharir - SIAM Journal on Computing, 2014 - SIAM
The Fréchet distance measures similarity between two curves f and g that takes into account
the ordering of the points along the two curves: Informally, it is the minimum length of a leash …

Indoor scene reconstruction using feature sensitive primitive extraction and graph-cut

S Oesau, F Lafarge, P Alliez - ISPRS journal of photogrammetry and …, 2014 - Elsevier
We present a method for automatic reconstruction of permanent structures, such as walls,
floors and ceilings, given a raw point cloud of an indoor scene. The main idea behind our …