
Efficient Dispersion of Mobile Agents without Global Knowledge
We consider the dispersion problem for mobile agents. Initially, k agent...
read it

New Algorithms and Lower Bounds for AllPairs MaxFlow in Undirected Graphs
We investigate the timecomplexity of the AllPairs MaxFlow problem: Gi...
read it

The Fluid Mechanics of Liquid Democracy
Liquid democracy is the principle of making collective decisions by lett...
read it

Patrolling on Dynamic Ring Networks
We study the problem of patrolling the nodes of a network collaborativel...
read it

Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities
We consider the task of rendezvous in networks modeled as undirected gra...
read it

Inputdynamic distributed graph algorithms for congested networks
Consider a distributed system, where the topology of the communication n...
read it

Tight Bounds for Black Hole Search in Dynamic Rings
In this paper, we start the investigation of distributed computing by mo...
read it
Synchronized Traveling Salesman Problem
We consider a variation of the wellknown traveling salesman problem in which there are multiple agents who all have to tour the whole set of nodes of the same graph, while obeying node and edgecapacity constraints require that agents must not "crash". We consider the simplest model in which the input is an undirected graph with all capacities equal to one. A solution to the synchronized traveling salesman problem is called an "agency". Our model puts the synchronized traveling salesman problem in a similar relation with the traveling salesman problem as the socalled evacuation problem, or the wellknown dynamic flow (flowovertime) problem is in relation with the minimum cost flow problem. We measure the strength of an agency in terms of number of agents which should be as large as possible, and the time horizon which should be as small as possible. Beside some elementary discussion of the notions introduced, we establish several upper and lower bounds for the strength of an agency under the assumption that the input graph is a tree, or a 3connected 3regular graph.
READ FULL TEXT
Comments
There are no comments yet.