This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...