Elaheh Fata

TL;DR: The properties of robustness and connectivity share the same threshold function in Erdös-Rényi graphs, and have the same values in 1-D geometric graphs and certain preferential attachment networks, providing new insights into the structure of such networks.

TL;DR: In this article, the authors consider the problem of planning a path for a robot to monitor a known set of features of interest in an environment, where the robot repeatedly performs a closed walk on the graph, and define the weighted latency of a vertex to be the maximum time between visits to that vertex, weighted by the importance of that vertex.

TL;DR: This paper considers the problem of planning a path for a robot to monitor a known set of features of interest in an environment as a graph with vertex weights and edge lengths, and provides two approximation algorithms that can be applied to problems consisting of thousands of vertices.

TL;DR: In this paper, the authors studied the properties of robustness and connectivity in the Erdos-Renyi model for complex networks and showed that the properties share the same threshold function in one-dimensional geometric graphs and preferential attachment networks.

TL;DR: This work considers an assortment optimization problem where a customer chooses a single item from a sequence of sets shown to her, while limited inventories constrain the items offered to customers over time, and derives a polynomial-time approximation algorithm which earns at least 1-ln(2-1/e), or 0.51, of the optimum.