Database Theory - ICDT 2005

DOI10.1007/B104421zbMATH Open1112.68373OpenAlexW4232873349MaRDI QIDQ5316618FDOQ5316618

Authors: 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

Recommendations

• Algorithms for distributional and adversarial pipelined filter ordering problems
• Pipelining in multi-query optimization.
• Set cover in sub-linear time
• scientific article; zbMATH DE number 1947050
• The online set cover problem

Mathematics Subject Classification ID

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

Cited In (16)

• Precedence-Constrained Min Sum Set Cover
• Decision-theoretic troubleshooting: hardness of approximation
• Pipelining in multi-query optimization.
• Ignorant vs. Anonymous Recommendations
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
• Pipelined operator tree scheduling in heterogeneous environments.
• Title not available (Why is that?)
• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
• Minimum Weighted Sum Bin Packing
• A General Framework for Approximating Min Sum Ordering Problems
• Weighted sum coloring in batch scheduling of conflicting jobs
• On competitive recommendations
• Min-sum bin packing
• Approximating optimal binary decision trees
• On min sum vertex cover and generalized min sum set cover
• Evaluation of monotone DNF formulas

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316618)