Pages that link to "Item:Q5248478"
From MaRDI portal
The following pages link to Linear programming without the matrix (Q5248478):
Displaying 8 items.
- The \(k\)-server problem (Q458484) (← links)
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- Two sensitivity theorems in fuzzy integer programming. (Q1421465) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)