We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Mino...
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Bar...
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...