Pages that link to "Item:Q3165959"
From MaRDI portal
The following pages link to All-Norms and All-L_p-Norms Approximation Algorithms (Q3165959):
Displaying 14 items.
- Matroid and knapsack center problems (Q300451) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine (Q2817891) (← links)
- An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem (Q3704347) (← links)
- All-norm approximation algorithms (Q4815768) (← links)
- (Q5091190) (← links)
- (Q5875462) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)