Deterministic Rendezvous in Graphs
Anders Dessmark,Pierre Fraigniaud,Andrzej Pelc +2 more
- Vol. 2832, Iss: 1, pp 184-195
TLDR
Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph and fast deterministic algorithms for this rendezvous problem are presented.Abstract:
Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We present fast deterministic algorithms for this rendezvous problem.read more
Citations
More filters
Book ChapterDOI
Engineering Route Planning Algorithms
TL;DR: An overview of the techniques enabling the development of algorithms for route planning in transportation networks and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-dependent routing, and flexible objective functions.
Book ChapterDOI
Highway hierarchies hasten exact shortest path queries
Peter Sanders,Dominik Schultes +1 more
TL;DR: A new speedup technique for route planning that exploits the hierarchy inherent in real world road networks and preprocesses the eight digit number of nodes needed for maps of the USA or Western Europe in a few hours using linear space.
Book ChapterDOI
An Algorithm to Find Overlapping Community Structure in Networks
TL;DR: A new algorithm for discovering overlapping communities in networks is presented, by extending Girvan and Newman's well-known algorithm based on the betweennesscentrality measure, which performs hierarchical clustering -- partitioning a network into any desired number of clusters -- but allows them to overlap.
Book ChapterDOI
On finding graph clusterings with maximum modularity
Ulrik Brandes,Daniel Delling,Marco Gaertler,Robert Görke,Martin Hoefer,Zoran Nikoloski,Dorothea Wagner +6 more
TL;DR: It is proved the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and an Integer Linear Programming formulation is given.
Book ChapterDOI
Maximum Coverage Problem with Group Budget Constraints and Applications
Chandra Chekuri,Amit Kumar +1 more
TL;DR: In this paper, a variant of the maximum coverage problem with group budget constraints (MCG) is studied, where each set S i is a subset of a given ground set X and the goal is to pick k sets from S i to maximize the cardinality of their union but with the additional restriction that at most one set be picked from each group.
References
More filters
Book
The Strategy of Conflict
TL;DR: In this paper, the authors propose a theory of interdependent decision based on the Retarded Science of International Strategy (RSIS) for non-cooperative games and a solution concept for "noncooperative" games.
Book
The Theory of Search Games and Rendezvous
Steven Alpern,Shmuel Gal +1 more
TL;DR: This book considers two possible motives of the target, and divides the book accordingly into the zero-sum game that results when the target (here called the Hider) does not want to be found and the opposite motive of thetarget, namely, that he wants to been found.
Journal ArticleDOI
The Rendezvous Search Problem
TL;DR: In this article, the rendezvous value of the region is defined as the probability that two players can find each other in the least expected time, and it is shown how symmetries in the search region may hinder the process by preventing coordination based on concepts such as north or clockwise.
Journal ArticleDOI
The rendezvous problem on discrete locations
Edward J. Anderson,Richard Weber +1 more
TL;DR: In this article, it is shown that the optimal rendezvous strategy with expected time until rendezvous of less than 0.829 n for large enough n can be obtained on average 2 and 8/3 steps.