Concept
Set cover problem
Related publications (88)
Optimal Task Assignment and Collision Avoidance for Mobile Robots
This report serves as a general overview of the semester project conducted in the SYCAMORE lab during the Spring 2022 semester. It focuses on multi- agent optimal task assignment methods, which have been implemented on state of the art simulation methods u ...
2022Minimum Cost Intervention Design for Causal Effect Identification
Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami
Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...
PMLR2022Knapsack and Subset Sum with Small Items
Adam Teodor Polak, Lars Rohwedder
Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomial running times for these problems with respect to various parameters. In t ...
Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2020