The following pages link to Database Theory - ICDT 2005 (Q5316618):
Displayed 12 items.
- Evaluation of monotone DNF formulas (Q521804) (← links)
- Min-sum bin packing (Q721936) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- Decision-theoretic troubleshooting: hardness of approximation (Q2440184) (← links)
- Ignorant vs. Anonymous Recommendations (Q3452859) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Minimum Weighted Sum Bin Packing (Q5443385) (← links)
- On competitive recommendations (Q5964063) (← links)