Data structures and network algorithms
Data structures and network algorithms
Least majorized elements and generalized polymatroids
Mathematics of Operations Research
The membership problem in jump systems
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Information Processing Letters
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Decentralized utility-based sensor network design
Mobile Networks and Applications
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Information Processing Letters
Selfish Load Balancing and Atomic Congestion Games
Algorithmica
A survey of game-theoretic approaches in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Balanced Edge Cover Problem
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Information Processing Letters
Faster algorithms for semi-matching problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Congestion games, load balancing, and price of anarchy
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
Faster algorithms for semi-matching problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Brief announcement: distributed approximations for the semi-matching problem
DISC'11 Proceedings of the 25th international conference on Distributed computing
Discrete Applied Mathematics
On computing an optimal semi-matching
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Distributed 2-approximation algorithm for the semi-matching problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Approximating semi-matchings in streaming and in two-party communication
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted case. For the weighted case, we give an O(nmlog n)-time algorithm, where n is the number of vertices and m is the number of edges, by exploiting the geometric structure of the problem. This improves the classical O(n3) algorithms by Horn [Operations Research 1973] and Bruno, Coffman and Sethi [Communications of the ACM 1974]. For the unweighted case, the bound could be improved even further.We give a simple divide-and-conquer algorithm which runs in O(√nmlog n) time, improving two previous O(nm)-time algorithms by Abraham [MSc thesis, University of Glasgow 2003] and Harvey, Ladner, Lov´sz and Tamir [WADS 2003 and Journal of Algorithms 2006]. We also extend this algorithm to solve the Balance Edge Cover problem in O(√nmlog n) time, improving the previous O(nm)-time algorithm by Harada, Ono, Sadakane and Yamashita [ISAAC 2008].