Zobrazeno 1 - 10
of 607
pro vyhledávání: '"Wolf Petra"'
Autor:
Balzereit, Kaja, Grüttemeier, Niels, Morawietz, Nils, Reinhardt, Dennis, Windmann, Stefan, Wolf, Petra
In this work, we study the task of scheduling jobs on a single machine with sequence dependent family setup times under the goal of minimizing the makespan, that is, the completion time of the last job in the schedule. This notoriously NP-hard proble
Externí odkaz:
http://arxiv.org/abs/2409.00771
A temporal graph is a graph whose edges only appear at certain points in time. Reachability in these graphs is defined in terms of paths that traverse the edges in chronological order (temporal paths). This form of reachability is neither symmetric n
Externí odkaz:
http://arxiv.org/abs/2406.19514
The analysis of (social) networks and multi-agent systems is a central theme in Artificial Intelligence. Some line of research deals with finding groups of agents that could work together to achieve a certain goal. To this end, different notions of s
Externí odkaz:
http://arxiv.org/abs/2309.06801
We study the kernelization of exploration problems on temporal graphs. A temporal graph consists of a finite sequence of snapshot graphs $\mathcal{G}=(G_1, G_2, \dots, G_L)$ that share a common vertex set but might have different edge sets. The non-s
Externí odkaz:
http://arxiv.org/abs/2302.10110
The Kemeny Rank Aggregation (KRA) problem is a well-studied problem in the field of Social Choice with a variety of applications in many different areas like databases and search engines. Intuitively, given a set of votes over a set of candidates, th
Externí odkaz:
http://arxiv.org/abs/2301.05146
All roads lead to Rome is the core idea of the puzzle game Roma. It is played on an $n \times n$ grid consisting of quadratic cells. Those cells are grouped into boxes of at most four neighboring cells and are either filled, or to be filled, with arr
Externí odkaz:
http://arxiv.org/abs/2207.09439
One of the most fundamental problems in computational learning theory is the the problem of learning a finite automaton $A$ consistent with a finite set $P$ of positive examples and with a finite set $N$ of negative examples. By consistency, we mean
Externí odkaz:
http://arxiv.org/abs/2206.10025
We study the computational complexity of determining structural properties of edge periodic temporal graphs (EPGs). EPGs are time-varying graphs that compactly represent periodic behavior of components of a dynamic network, for example, train schedul
Externí odkaz:
http://arxiv.org/abs/2203.07401
Publikováno v:
In Journal of Computer and System Sciences September 2024 144
