Author of the publication

Online removable knapsack with limited cuts.

, and . Theor. Comput. Sci., 411 (44-46): 3956-3964 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximating minimum representations of key Horn functions., , , , and . CoRR, (2018)Disjunctions of Horn Theories and Their Cores., , and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 49-58. Springer, (1998)On Disguised Double Horn Functions and Extensions., , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 50-60. Springer, (1998)On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets., , , and . STACS, volume 2285 of Lecture Notes in Computer Science, page 133-141. Springer, (2002)Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits., , and . IFIP TCS, volume 1872 of Lecture Notes in Computer Science, page 257-272. Springer, (2000)Randomized Algorithms for Removable Online Knapsack Problems., , and . FAW-AAIM, volume 7924 of Lecture Notes in Computer Science, page 60-71. Springer, (2013)Boolean Analysis of Incomplete Examples., , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 440-451. Springer, (1996)Unit Cost Buyback Problem., , and . Theory Comput. Syst., 63 (6): 1185-1206 (2019)Locating Sources to Meet Flow Demands in Undirected Networks., , , and . J. Algorithms, 42 (1): 54-68 (2002)A representation of antimatroids by Horn rules and its application to educational systems., , and . CoRR, (2015)