Faster Algorithms for Semi-matching Problems (Extended Abstract)

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.

[1]  Ming-Yang Kao,et al.  An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings , 2001, J. Algorithms.

[2]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[3]  Yefim Dinitz,et al.  Dinitz' Algorithm: The Original Version and Even's Version , 2006, Essays in Memory of Shimon Even.

[4]  Wenhua Li,et al.  Parallel machine scheduling of machine-dependent jobs with unit-length , 2004, Eur. J. Oper. Res..

[5]  LeeKangbok,et al.  Scheduling jobs with equal processing times subject to machine eligibility constraints , 2011 .

[6]  Arie Tamir,et al.  Least Majorized Elements and Generalized Polymatroids , 1995, Math. Oper. Res..

[7]  Chung-Lun Li,et al.  Scheduling unit-length jobs with machine eligibility restrictions , 2006, Eur. J. Oper. Res..

[8]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[9]  Edward G. Coffman,et al.  Algorithms for Minimizing Mean Flow Time , 1974, IFIP Congress.

[10]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[11]  Chor Ping Low.  An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs , 2006, Inf. Process. Lett..

[12]  Csaba D. Tóth,et al.  Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.

[13]  Tami Tamir,et al.  Algorithms for storage allocation based on client preferences , 2010, J. Comb. Optim..

[14]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[15]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[16]  Mitali Singh,et al.  Decentralized Utility-based Sensor Network Design , 2006, Mob. Networks Appl..

[17]  Rasaratnam Logendran,et al.  Unrelated parallel machine scheduling with job splitting , 2004 .

[18]  Bostjan Bresar,et al.  A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks , 2009, Discret. Appl. Math..

[19]  László Lovász,et al.  Semi-matchings for bipartite graphs and load balancing , 2006, J. Algorithms.

[20]  László Lovász.  The Membership Problem in Jump Systems , 1997, J. Comb. Theory, Ser. B.

[21]  Kunihiko Sadakane,et al.  Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs , 2007 .

[22]  Chor Ping Low,et al.  An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique , 2002, Inf. Process. Lett..

[23]  Joseph Y.-T. Leung,et al.  A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs" , 2009, Inf. Process. Lett..

[24]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

[25]  Csaba D. Tóth,et al.  Uncoordinated Load Balancing and Congestion Games in P2P Systems , 2004, IPTPS.

[26]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.

[27]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 2001, Combinatorial Optimization.

[28]  Joseph Y.-T. Leung,et al.  Scheduling jobs with equal processing times subject to machine eligibility constraints , 2010, J. Sched..

[29]  Jeannette Janssen,et al.  Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers , 2007, CAAN.

[30]  Sirin Tekinay,et al.  A survey of game-theoretic approaches in wireless sensor networks , 2008, Comput. Networks.

[31]  David J. Evans,et al.  Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories , 1985 .

[32]  Zsuzsanna Vaik,et al.  Egerváry Research Group on Combinatorial Optimization on Scheduling Problems with Parallel Multi-purpose Machines on Scheduling Problems with Parallel Multi-purpose Machines , 2022 .

[33]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[34]  Kunihiko Sadakane,et al.  The Balanced Edge Cover Problem , 2008, ISAAC.

[35]  Csaba D. Tóth,et al.  Congestion Games, Load Balancing, and Price of Anarchy , 2004, CAAN.

[36]  Ling-Huey Su,et al.  Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints , 2009 .

[37]  René Sitters.  Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines , 2001, IPCO.