Database Theory - ICDT 2005

DOI10.1007/B104421MaRDI QIDQ5316618zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(18)

• Precedence-Constrained Min Sum Set Cover
• Decision-theoretic troubleshooting: hardness of approximation
• Pipelining in multi-query optimization.
• Pipelined operator tree scheduling in heterogeneous environments.
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
• scientific article; zbMATH DE number 1863259 (Why is no real title available?)
• 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
• Parallel pipelined filter ordering with precedence constraints
• On competitive recommendations
• Ignorant vs. anonymous recommendations
• Algorithms for distributional and adversarial pipelined filter ordering problems
• 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)