Database Theory - ICDT 2005

DOI10.1007/b104421zbMath1112.68373OpenAlexW4232873349MaRDI QIDQ5316618

Kamesh Munagala, Shivnath Babu, Jennifer Widom, Rajeev Motwani

Publication date: 13 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104421

Mathematics Subject Classification ID

Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (12)

Ignorant vs. Anonymous Recommendations ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ Approximating optimal binary decision trees ⋮ Decision-theoretic troubleshooting: hardness of approximation ⋮ Evaluation of monotone DNF formulas ⋮ Minimum Weighted Sum Bin Packing ⋮ Min-sum bin packing ⋮ On competitive recommendations ⋮ Solving the non-unicost set covering problem by using cuckoo search and black hole optimization ⋮ Weighted sum coloring in batch scheduling of conflicting jobs ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines ⋮ Precedence-Constrained Min Sum Set Cover

This page was built for publication: Database Theory - ICDT 2005