Works matching IS 14324350 AND DT 2021 AND VI 65 AND IP 5

Results: 6
    1
    2
    3
    4

    Approximability of open k-monopoly problems.

    Published in:
    Theory of Computing Systems, 2021, v. 65, n. 5, p. 798, doi. 10.1007/s00224-020-10027-4
    By:
    • Mishra, Sounaka;
    • Krishna, B. Arjuna;
    • Rajakrishnan, Shijin
    Publication type:
    Article
    5

    The subset sum game revisited.

    Published in:
    Theory of Computing Systems, 2021, v. 65, n. 5, p. 884, doi. 10.1007/s00224-021-10034-z
    By:
    • Pieterse, Astrid;
    • Woeginger, Gerhard J.
    Publication type:
    Article
    6

    Minimum Reload Cost Graph Factors.

    Published in:
    Theory of Computing Systems, 2021, v. 65, n. 5, p. 815, doi. 10.1007/s00224-020-10012-x
    By:
    • Baste, Julien;
    • Gözüpek, Didem;
    • Shalom, Mordechai;
    • Thilikos, Dimitrios M.
    Publication type:
    Article