Pages that link to "Item:Q870840"
From MaRDI portal
The following pages link to Optimal semi-online algorithms for machine covering (Q870840):
Displaying 9 items.
- Online maximum \(k\)-coverage (Q442204) (← links)
- A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074) (← links)
- Machine covering with combined partial information (Q972842) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Approximation and Online Algorithms (Q5898467) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)