Semi-matchings for bipartite graphs and load balancing
From MaRDI portal
Publication:5491460
DOI10.1016/j.jalgor.2005.01.003zbMath1100.68079MaRDI QIDQ5491460
Nicholas J. A. Harvey, László Lovász, Richard E. Ladner, Tami Tamir
Publication date: 5 October 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2005.01.003
68R10: Graph theory (including graph drawing) in computer science
90B35: Deterministic scheduling theory in operations research
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Density decompositions of networks, Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks, Matching with sizes (or scheduling with processing set restrictions), Matching with sizes (or scheduling with processing set restrictions), The existence of universally agreed fairest semi-matchings in any given bipartite graph, Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times, Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks, A Survey of the Generalized Assignment Problem and Its Applications, Literal Selection in Switching Lattice Design, Solving the at-most-once problem with nearly optimal effectiveness, The minimum maximal k-partial-matching problem, A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks, Scheduling unit length jobs on parallel machines with lookahead information, On the distributed complexity of the semi-matching problem, Algorithms for storage allocation based on client preferences, Distributed backup placement in networks, Online scheduling of two job types on a set of multipurpose machines with unit processing times, Multipurpose machine scheduling with rejection and identical job processing times, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on M-convex sets: algorithms and applications, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases, On computing an optimal semi-matching, Parallel machine scheduling with nested processing set restrictions, Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines, Faster Algorithms for Semi-Matching Problems, Online Collaborative Filtering on Graphs, Brief Announcement: Distributed Approximations for the Semi-matching Problem, On Computing an Optimal Semi-matching
