Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...