Pages that link to "Item:Q5491460"

The following pages link to Semi-matchings for bipartite graphs and load balancing (Q5491460):

Displaying 28 items.

• Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
• The minimum maximal k-partial-matching problem (Q395867) (← links)
• A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks (Q412342) (← links)
• Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
• On the distributed complexity of the semi-matching problem (Q736606) (← links)
• Algorithms for storage allocation based on client preferences (Q975763) (← links)
• Distributed backup placement in networks (Q1741963) (← links)
• Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
• Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
• On computing an optimal semi-matching (Q2408093) (← links)
• Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
• Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
• Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
• Online Collaborative Filtering on Graphs (Q2830757) (← links)
• Brief Announcement: Distributed Approximations for the Semi-matching Problem (Q3095327) (← links)
• On Computing an Optimal Semi-matching (Q3104781) (← links)
• Density decompositions of networks (Q5233139) (← links)
• Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks (Q5391125) (← links)
• Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
• Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
• Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
• The existence of universally agreed fairest semi-matchings in any given bipartite graph (Q5918112) (← links)
• Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
• Literal Selection in Switching Lattice Design (Q6181731) (← links)