Prohlížení dle autora "Knop D."

Zobrazují se záznamy 1-3 z 3

    • Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra 

      Autor: Blažej V.; Knop D.; Pokorný J.; Schierreich Š.
      (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2024)
      In the Equitable Connected Partition (ECP for short) problem, we are given a graph $G=(V,E)$ together with an integer $p\in\mathbb{N}$, and our goal is to find a partition of~$V$ into~$p$~parts such that each part induces ...

    • Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology 

      Autor: Fioravantes F.; Knop D.; Křišťan J.; Melissinos N.; Opler M.
      (AAAI Press, 2024)
      In the Multiagent Path Finding (MAPF for short) problem, we focus on efficiently finding non-colliding paths for a set of k agents on a given graph G, where each agent seeks a path from its source vertex to a target. An ...

    • Individual Rationality in Topological Distance Games is Surprisingly Hard 

      Autor: Deligkas A.; Eiben E.; Knop D.; Schierreich Š.
      (International Joint Conferences on Artificial Intelligence Organization, 2024)
      In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depends on both the agent's inherent utilities ...