1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2018
On bounded pitch inequalities for the min-knapsack polytope
Yuri Faenza, Igor Malinović, Monaldo Mastrolilli +1
In the min-knapsack problem one aims at choosing a set of objects with minimum total cost and total profit above a given threshold. In this paper, we study a class of valid inequal…
cs.DS2017★ 1 cited
A PTAS for the Time-Invariant Incremental Knapsack problem
Yuri Faenza, Igor Malinovic
The Time-Invariant Incremental Knapsack problem (IIK) is a generalization of Maximum Knapsack to a discrete multi-period setting. At each time, capacity increases and items can be…
cs.CG2013
Clustered planarity testing revisited
Radoslav Fulek, Jan Kynčl, Igor Malinović +1
The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every p…