Pages that link to "Item:Q1959735"

The following pages link to Faster algorithms for stable allocation problems (Q1959735):

Displaying 26 items.

• Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
• A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments (Q933267) (← links)
• Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085) (← links)
• Stable flows over time (Q1736580) (← links)
• Fractional solutions for capacitated NTU-games, with applications to stable matchings (Q1751188) (← links)
• The integral stable allocation problem on graphs (Q1952506) (← links)
• An efficient algorithm for batch stability testing (Q1959725) (← links)
• Paths to stable allocations (Q2329415) (← links)
• Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
• Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
• Blockers and antiblockers of stable matchings (Q2637344) (← links)
• Stable allocations and partially ordered sets (Q2684044) (← links)
• A new algorithm for stable assignments (Q3202138) (← links)
• Improved Approximation Algorithms for Budgeted Allocations (Q3521918) (← links)
• A new algorithm for stable assignment (Q4375407) (← links)
• Finding a Stable Allocation in Polymatroid Intersection (Q4575653) (← links)
• Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)
• (Q5136216) (← links)
• The Stable Allocation (or Ordinal Transportation) Problem (Q5704093) (← links)
• New and simple algorithms for stable flow problems (Q5915793) (← links)
• Review of the theory of stable matchings and contract systems (Q6039790) (← links)
• On stable flows and preflows (Q6039791) (← links)
• Marriage and Roommate (Q6066467) (← links)
• On the set of stable matchings in a bipartite graph (Q6078002) (← links)
• Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042) (← links)
• On stable assignments generated by choice functions of mixed type (Q6611057) (← links)