Efficient algorithms for the 2-gathering problem

Authors:
Alon Shalita;Uri Zwick
Affiliations:
Tel Aviv University, Tel Aviv, Israel;Tel Aviv University, Tel Aviv, Israel
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2010

Citing 13
Cited 0

General factors of graphs

Journal of Combinatorial Theory Series B
Faster scaling algorithms for general graph matching problems

Journal of the ACM (JACM)
General antifactors of graphs

Journal of Combinatorial Theory Series B
Clique partitions, graph compression and speeding-up algorithms

Journal of Computer and System Sciences
Building Steiner trees with incomplete global knowledge

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Achieving anonymity via clustering

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Terminal backup, 3D matching, and covering cubic graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower-bounded facility location

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Aspects of network design

Aspects of network design
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
On min-max r-gatherings

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pebbles are placed on some vertices of a directed graph. Is it possible to move each pebble along at most one edge of the graph so that in the final configuration no pebble is left on its own? We give an O(mn)-time algorithm for solving this problem, which we call the 2-gathering problem, where n is the number of vertices and m is the number of edges of the graph. If such a 2-gathering is not possible, the algorithm finds a solution that minimizes the number of solitary pebbles. The 2-gathering problem forms a nontrivial generalization of the nonbipartite matching problem and it is solved by extending the augmenting paths technique used to solve matching problems.