Pages that link to "Item:Q703276"
From MaRDI portal
The following pages link to Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276):
Displaying 5 items.
- Real time scheduling with a budget: parametric-search is better than binary search (Q845717) (← links)
- Partial multicuts in trees (Q861281) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)