Database Theory - ICDT 2005
From MaRDI portal
Publication:5316618
DOI10.1007/b104421zbMath1112.68373MaRDI 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
68P15: Database theory
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
A General Framework for Approximating Min Sum Ordering Problems, Precedence-Constrained Min Sum Set Cover, Minimum Weighted Sum Bin Packing, On competitive recommendations, Evaluation of monotone DNF formulas, Min-sum bin packing, Weighted sum coloring in batch scheduling of conflicting jobs, Solving the non-unicost set covering problem by using cuckoo search and black hole optimization, On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines, Approximating optimal binary decision trees, Decision-theoretic troubleshooting: hardness of approximation, Ignorant vs. Anonymous Recommendations