Pages that link to "Item:Q3569830"
From MaRDI portal
The following pages link to On Column-Restricted and Priority Covering Integer Programs (Q3569830):
Displayed 21 items.
- Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Demand Hitting and Covering of Intervals (Q2971657) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- Resource allocation problem under single resource assignment (Q4553878) (← links)
- Improved Algorithm for Resource Allocation Problems (Q4604919) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- (Q5743501) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)
- On improved interval cover mechanisms for crowdsourcing markets (Q6164503) (← links)