Pages that link to "Item:Q1401329"

The following pages link to Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329):

Displaying 9 items.

• Labeled cuts in graphs (Q313962) (← links)
• Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
• Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
• On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
• Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
• Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
• Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
• Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
• Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)