DIKUL - logo

Search results

Basic search    Expert search   

Currently you are NOT authorised to access e-resources UL. For full access, REGISTER.

1 2 3 4 5
hits: 168
1.
  • On maximin share allocation... On maximin share allocations in matroids
    Gourvès, Laurent; Monnot, Jérôme Theoretical computer science, 01/2019, Volume: 754
    Journal Article
    Peer reviewed
    Open access

    The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always ...
Full text
Available for: UL
2.
  • Computing and testing Paret... Computing and testing Pareto optimal committees
    Aziz, Haris; Monnot, Jérôme Autonomous agents and multi-agent systems, 04/2020, Volume: 34, Issue: 1
    Journal Article
    Peer reviewed
    Open access

    Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for desirability of a committee, ...
Full text
Available for: UL

PDF
3.
  • On the complexity of soluti... On the complexity of solution extension of optimization problems
    Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi ... Theoretical computer science, 02/2022, Volume: 904
    Journal Article
    Peer reviewed
    Open access

    •Extending a partial solution of an optimization problem occurs as a subproblem in many areas.•We propose a general framework for dealing with these extension problems.•We present several problems ...
Full text
Available for: UL

PDF
4.
  • Algorithmic aspects of uppe... Algorithmic aspects of upper edge domination
    Monnot, Jérôme; Fernau, Henning; Manlove, David Theoretical computer science, 07/2021, Volume: 877
    Journal Article
    Peer reviewed
    Open access

    •We focus on Upper EDS, the problem of finding a minimal edge dominating set of maximum size in a given graph G = (V,E).•We show that Upper EDS is not approximable within a ratio of nϵ−12, for any ...
Full text
Available for: UL
5.
  • Efficient reallocation unde... Efficient reallocation under additive and responsive preferences
    Aziz, Haris; Biró, Péter; Lang, Jérôme ... Theoretical computer science, 10/2019, Volume: 790
    Journal Article
    Peer reviewed
    Open access

    Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. While finding an arbitrary Pareto optimal allocation is generally easy, checking ...
Full text
Available for: UL

PDF
6.
Full text

PDF
7.
  • Project games Project games
    Bilò, Vittorio; Gourvès, Laurent; Monnot, Jérôme Theoretical computer science, 01/2023, Volume: 940, Issue: Part A
    Journal Article
    Peer reviewed
    Open access

    We consider a strategic game, called project game, where each agent has to choose a project among her own list of available projects. The model includes positive weights expressing the capacity of a ...
Full text
Available for: UL
8.
  • Extension of some edge grap... Extension of some edge graph problems: Standard, parameterized and approximation complexity
    Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi ... Discrete Applied Mathematics, 12/2023, Volume: 340
    Journal Article
    Peer reviewed
    Open access

    We consider extension variants of some edge optimization problems in graphs containing the classical Edge Cover, Matching, and Edge Dominating Set problems and generalizations thereof. Given a graph ...
Full text
Available for: UL
9.
  • Complexity and algorithms f... Complexity and algorithms for constant diameter augmentation problems
    Kim, Eun Jung; Milanič, Martin; Monnot, Jérôme ... Theoretical computer science, 02/2022, Volume: 904
    Journal Article
    Peer reviewed
    Open access

    •For given integers d, k and graph G, can we obtain a graph with diameter d via at most k edge deletions?•We determine the computational complexity of this and related problems for different values ...
Full text
Available for: UL

PDF
10.
  • Extension and its price for... Extension and its price for the connected vertex cover problem
    Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme ... Theoretical computer science, 02/2022, Volume: 904
    Journal Article
    Peer reviewed
    Open access

    •Definition and study of the extension variants of the connected vertex cover problem (Ext-CVC), and of the Non-Separating Independent Set problem (Ext-NSIS).•Solvability and hardness results for ...
Full text
Available for: UL

PDF
1 2 3 4 5
hits: 168

Load filters