1,271 results on '"Niedermeier, Rolf"'
Search Results
2. Parameterized Algorithms for Colored Clustering
- Author
-
Kellerhals, Leon, Koana, Tomohiro, Kunz, Pascal, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an endpoint and are colored differently. Equivalently, the goal can also be described as assigning colors to the vertices in a way that fits the edge-coloring as well as possible. As this problem is NP-hard, we build on previous work by studying its parameterized complexity. We give a $2^{\mathcal O(k)} \cdot n^{\mathcal O(1)}$-time algorithm where $k$ is the number of edges to be selected and $n$ the number of vertices. We also prove the existence of a problem kernel of size $\mathcal O(k^{5/2} )$, resolving an open problem posed in the literature. We consider parameters that are smaller than $k$, the number of edges to be selected, and $r$, the number of edges that can be deleted. Such smaller parameters are obtained by considering the difference between $k$ or $r$ and some lower bound on these values. We give both algorithms and lower bounds for Colored Clustering with such parameterizations. Finally, we settle the parameterized complexity of Colored Clustering with respect to structural graph parameters by showing that it is $W[1]$-hard with respect to both vertex cover number and tree-cut width, but fixed-parameter tractable with respect to slim tree-cut width.
- Published
- 2023
3. Equilibria in schelling games: computational hardness and robustness
- Author
-
Kreisel, Luca, Boehmer, Niclas, Froese, Vincent, and Niedermeier, Rolf
- Published
- 2024
- Full Text
- View/download PDF
4. Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions
- Author
-
Heeger, Klaus, Nichterlein, André, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
We provide a general framework to exclude parameterized running times of the form $O(\ell^\beta+ n^\gamma)$ for problems that have polynomial running time lower bounds under hypotheses from fine-grained complexity. Our framework is based on cross-compositions from parameterized complexity. We (conditionally) exclude running times of the form $O(\ell^{{\gamma}/{(\gamma-1)} - \epsilon} + n^\gamma)$ for any $1<\gamma<2$ and $\epsilon>0$ for the following problems: - Longest Common Subsequence: Given two length-$n$ strings and $\ell\in\mathbb{N}$, is there a common subsequence of length $\ell$? - Discrete Fr\'echet Distance: Given two lists of $n$ points each and $k\in \mathbb{N}$, is the Fr\'echet distance of the lists at most $k$? Here $\ell$ is the maximum number of points which one list is ahead of the other list in an optimum traversal. Moreover, we exclude running times $O(\ell^{{2\gamma}/{(\gamma -1)}-\epsilon} + n^\gamma)$ for any $1<\gamma<3$ and $\epsilon>0$ for: - Negative Triangle: Given an edge-weighted graph with $n$ vertices, is there a triangle whose sum of edge-weights is negative? Here $\ell$ is the order of a maximum connected component. - Triangle Collection: Given a vertex-colored graph with $n$ vertices, is there for each triple of colors a triangle whose vertices have these three colors? Here $\ell$ is the order of a maximum connected component. - 2nd Shortest Path: Given an $n$-vertex edge-weighted directed graph, two vertices $s$ and $t$, and $k \in \mathbb{N}$, has the second longest $s$-$t$-path length at most $k$? Here $\ell$ is the directed feedback vertex set. Except for 2nd Shortest Path all these running time bounds are tight, that is, algorithms with running time $O(\ell^{{\gamma}/{(\gamma-1)}} + n^\gamma )$ for any $1 < \gamma < 2$ and $O(\ell^{{2\gamma}/{(\gamma -1)}} + n^\gamma)$ for any $1 < \gamma < 3$, respectively, are known.
- Published
- 2023
5. A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners
- Author
-
Boehmer, Niclas, Bredereck, Robert, Faliszewski, Piotr, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Economics - Theoretical Economics - Abstract
Contributing to the toolbox for interpreting election results, we evaluate the robustness of election winners to random noise. We compare the robustness of different voting rules and evaluate the robustness of real-world election winners from the Formula 1 World Championship and some variant of political elections. We find many instances of elections that have very non-robust winners and numerous delicate robustness patterns that cannot be identified using classical and simpler approaches., Comment: Accepted to EAAMO'22
- Published
- 2022
6. Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
- Author
-
Boehmer, Niclas, Heeger, Klaus, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Discrete Mathematics - Abstract
When computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change over time. Consequently, an initially stable matching may become unstable. Then, a natural goal is to find a matching which is stable with respect to the modified preferences and as close as possible to the initial one. For Stable Marriage/Roommates, this problem was formally defined as Incremental Stable Marriage/Roommates by Bredereck et al. [AAAI '20]. As they showed that Incremental Stable Roommates and Incremental Stable Marriage with Ties are NP-hard, we focus on the parameterized complexity of these problems. We answer two open questions of Bredereck et al. [AAAI '20]: We show that Incremental Stable Roommates is W[1]-hard parameterized by the number of changes in the preferences, yet admits an intricate XP-algorithm, and we show that Incremental Stable Marriage with Ties is W[1]-hard parameterized by the number of ties. Furthermore, we analyze the influence of the degree of "similarity" between the agents' preference lists, identifying several polynomial-time solvable and fixed-parameter tractable cases, but also proving that Incremental Stable Roommates and Incremental Stable Marriage with Ties parameterized by the number of different preference lists are W[1]-hard., Comment: Accepted to MFCS'22
- Published
- 2022
7. There and Back Again: On Applying Data Reduction Rules by Undoing Others
- Author
-
Figiel, Aleksander, Froese, Vincent, Nichterlein, André, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
Data reduction rules are an established method in the algorithmic toolbox for tackling computationally challenging problems. A data reduction rule is a polynomial-time algorithm that, given a problem instance as input, outputs an equivalent, typically smaller instance of the same problem. The application of data reduction rules during the preprocessing of problem instances allows in many cases to considerably shrink their size, or even solve them directly. Commonly, these data reduction rules are applied exhaustively and in some fixed order to obtain irreducible instances. It was often observed that by changing the order of the rules, different irreducible instances can be obtained. We propose to "undo" data reduction rules on irreducible instances, by which they become larger, and then subsequently apply data reduction rules again to shrink them. We show that this somewhat counter-intuitive approach can lead to significantly smaller irreducible instances. The process of undoing data reduction rules is not limited to "rolling back" data reduction rules applied to the instance during preprocessing. Instead, we formulate so-called backward rules, which essentially undo a data reduction rule, but without using any information about which data reduction rules were applied to it previously. In particular, based on the example of Vertex Cover we propose two methods applying backward rules to shrink the instances further. In our experiments we show that this way smaller irreducible instances consisting of real-world graphs from the SNAP and DIMACS datasets can be computed., Comment: extended abstract to appear at ESA 2022
- Published
- 2022
8. Understanding Distance Measures Among Elections
- Author
-
Boehmer, Niclas, Faliszewski, Piotr, Niedermeier, Rolf, Szufa, Stanisław, and Wąs, Tomasz
- Subjects
Computer Science - Computer Science and Game Theory ,Economics - Theoretical Economics - Abstract
Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challenging-to-compute but very precise swap distance and the distance used to form the so-called map of elections. Among the six, the latter seems to strike the best balance between its computational complexity and expressiveness., Comment: Accepted to IJCAI 2022
- Published
- 2022
9. Fair Short Paths in Vertex-Colored Graphs
- Author
-
Bentert, Matthias, Kellerhals, Leon, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Computational Complexity - Abstract
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a group (color), we provide a framework to model multiple natural fairness aspects. We seek to find short paths in which the number of occurrences of each color is within some given lower and upper bounds. Among other results, we prove the introduced problems to be computationally intractable (NP-hard and parameterized hard with respect to the number of colors) even in very restricted settings (such as each color should appear with exactly the same frequency), while also presenting an encouraging algorithmic result ("fixed-parameter tractability") related to the length of the sought solution path for the general problem., Comment: Full version of a paper accepted at AAAI '23
- Published
- 2022
10. Delay-Robust Routes in Temporal Graphs
- Author
-
Füchsle, Eugen, Molter, Hendrik, Niedermeier, Rolf, and Renken, Malte
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodities, this fact must be considered for the the planning of itineraries. This has already led to several well-studied algorithmic problems on temporal graphs. The difficulty of the described task is increased by the fact that connections are often unreliable -- in particular, many modes of transportation suffer from occasional delays. If these delays cause subsequent connections to be missed, the consequences can be severe. Thus, it is a vital problem to design itineraries that are robust to (small) delays. We initiate the study of this problem from a parameterized complexity perspective by proving its NP-completeness as well as several hardness and tractability results for natural parameterizations.
- Published
- 2022
11. Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
- Author
-
Füchsle, Eugen, Molter, Hendrik, Niedermeier, Rolf, and Renken, Malte
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
Consider planning a trip in a train network. In contrast to, say, a road network, the edges are temporal, i.e., they are only available at certain times. Another important difficulty is that trains, unfortunately, sometimes get delayed. This is especially bad if it causes one to miss subsequent trains. The best way to prepare against this is to have a connection that is robust to some number of (small) delays. An important factor in determining the robustness of a connection is how far in advance delays are announced. We give polynomial-time algorithms for the two extreme cases: delays known before departure and delays occurring without prior warning (the latter leading to a two-player game scenario). Interestingly, in the latter case, we show that the problem becomes PSPACE-complete if the itinerary is demanded to be a path.
- Published
- 2022
12. A multivariate complexity analysis of the material consumption scheduling problem
- Author
-
Bentert, Matthias, Bredereck, Robert, Györgyi, Péter, Kaczmarczyk, Andrzej, and Niedermeier, Rolf
- Published
- 2023
- Full Text
- View/download PDF
13. Fairness in Repetitive Scheduling
- Author
-
Hermelin, Danny, Molter, Hendrik, Niedermeier, Rolf, Pinedo, Michael, and Shabtay, Dvir
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics - Abstract
Recent research found that fairness plays a key role in customer satisfaction. Therefore, many manufacturing and services industries have become aware of the need to treat customers fairly. Still, there is a huge lack of models that enable industries to make operational decisions fairly, such as a fair scheduling of the customers' jobs. Our main aim in this research is to provide a unified framework to enable schedulers making fair decisions in repetitive scheduling environments. For doing so, we consider a set of repetitive scheduling problems involving a set of $n$ clients. In each out of $q$ consecutive operational periods (e.g. days), each one of the customers submits a job for processing by an operational system. The scheduler's aim is to provide a schedule for each of the $q$ periods such that the quality of service (QoS) received by each of the clients will meet a certain predefined threshold. The QoS of a client may take several different forms, e.g., the number of days that the customer receives its job later than a given due-date, the number of times the customer receive his preferred time slot for service, or the sum of waiting times for service. We analyze the single machine variant of the problem for several different definitions of QoS, and classify the complexity of the corresponding problems using the theories of classical and parameterized complexity. We also study the price of fairness, i.e., the loss in the system's efficiency that results from the need to provide fair solutions.
- Published
- 2021
14. On Improving Resource Allocations by Sharing
- Author
-
Bredereck, Robert, Kaczmarczyk, Andrzej, Luo, Junjie, Niedermeier, Rolf, and Sachse, Florian
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Computers and Society ,Computer Science - Multiagent Systems ,Computer Science - Social and Information Networks ,J.4 ,G.2.3 ,G.2.2 ,F.2.2 - Abstract
Given an initial resource allocation, where some agents may envy others or where a different distribution of resources might lead to higher social welfare, our goal is to improve the allocation without reassigning resources. We consider a sharing concept allowing resources being shared with social network neighbors of the resource owners. To this end, we introduce a formal model that allows a central authority to compute an optimal sharing between neighbors based on an initial allocation. Advocating this point of view, we focus on the most basic scenario where a resource may be shared by two neighbors in a social network and each agent can participate in a bounded number of sharings. We present algorithms for optimizing utilitarian and egalitarian social welfare of allocations and for reducing the number of envious agents. In particular, we examine the computational complexity with respect to several natural parameters. Furthermore, we study cases with restricted social network structures and, among others, devise polynomial-time algorithms in path- and tree-like (hierarchical) social networks., Comment: Accepted at the 36th AAAI Conference on Artificial Intelligence, AAAI-22
- Published
- 2021
15. Temporal Interval Cliques and Independent Sets
- Author
-
Hermelin, Danny, Itzhaki, Yuval, Molter, Hendrik, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics - Abstract
Temporal graphs have been recently introduced to model changes to a given network that occur throughout a fixed period of time. The Temporal $\Delta$ Clique problem, that generalizes the well known Clique problem to temporal graphs, has been studied in the context of finding nodes of interest in dynamic networks [TCS '16]. We introduce the Temporal $\Delta$ Independent Set problem, a temporal generalization of Independent Set. This problem is e.g. motivated in the context of finding conflict-free schedules for maximum subsets of tasks, that have certain (changing) constraints on each day they need to be performed. We are specifically interested in the case where each task needs to be performed in a certain time-interval on each day and two tasks are in conflict on a certain day if their time-intervals on that day overlap. This leads us to considering both problems on the restricted class of temporal unit interval graphs, i.e., temporal graphs where each layer is a unit interval graph. We present several hardness results as well as positive results. On the algorithmic side, we provide constant-factor approximation algorithms for instances of both problems where $\tau$, the total number of time steps (layers) of the temporal graph, and $\Delta$, a parameter that allows us to model conflict tolerance, are constants. We develop an exact FPT algorithm for Temporal $\Delta$ Clique with respect to parameter $\tau+k$. Finally, we use the notion of order preservation for temporal unit interval graphs that, informally, requires the intervals of every layer to obey a common ordering. For both problems we provide an FPT algorithm parameterized by the size of minimum vertex deletion set to order preservation.
- Published
- 2021
16. Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets
- Author
-
Boehmer, Niclas, Heeger, Klaus, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Data Structures and Algorithms - Abstract
Following up on purely theoretical work of Bredereck et al. [AAAI 2020], we contribute further theoretical insights into adapting stable two-sided matchings to change. Moreover, we perform extensive empirical studies hinting at numerous practically useful properties. Our theoretical extensions include the study of new problems (that is, incremental variants of Almost Stable Marriage and Hospital Residents), focusing on their (parameterized) computational complexity and the equivalence of various change types (thus simplifying algorithmic and complexity-theoretic studies for various natural change scenarios). Our experimental findings reveal, for instance, that allowing the new matching to be blocked by a few pairs significantly decreases the necessary differences between the old and the new stable matching., Comment: Accepted to AAAI'22
- Published
- 2021
17. Modification-Fair Cluster Editing
- Author
-
Froese, Vincent, Kellerhals, Leon, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Machine Learning - Abstract
The classic Cluster Editing problem (also known as Correlation Clustering) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge modifications. When applied to vertex-colored graphs (the colors representing subgroups), standard algorithms for the NP-hard Cluster Editing problem may yield solutions that are biased towards subgroups of data (e.g., demographic groups), measured in the number of modifications incident to the members of the subgroups. We propose a modification fairness constraint which ensures that the number of edits incident to each subgroup is proportional to its size. To start with, we study Modification-Fair Cluster Editing for graphs with two vertex colors. We show that the problem is NP-hard even if one may only insert edges within a subgroup; note that in the classic "non-fair" setting, this case is trivially polynomial-time solvable. However, in the more general editing form, the modification-fair variant remains fixed-parameter tractable with respect to the number of edge edits. We complement these and further theoretical results with an empirical analysis of our model on real-world social networks where we find that the price of modification-fairness is surprisingly low, that is, the cost of optimal modification-fair solutions differs from the cost of optimal "non-fair" solutions only by a small percentage., Comment: AAAI 2022
- Published
- 2021
18. High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
- Author
-
Bredereck, Robert, primary, Kaczmarczyk, Andrzej, additional, Knop, Dušan, additional, and Niedermeier, Rolf, additional
- Published
- 2023
- Full Text
- View/download PDF
19. Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives
- Author
-
Kunz, Pascal, Fluschnik, Till, Niedermeier, Rolf, and Renken, Malte
- Subjects
Computer Science - Computational Complexity ,Computer Science - Computational Geometry - Abstract
Proximity graphs have been studied for several decades, motivated by applications in computational geometry, geography, data mining, and many other fields. However, the computational complexity of classic graph problems on proximity graphs mostly remained open. We now study 3-Colorability, Dominating Set, Feedback Vertex Set, Hamiltonian Cycle, and Independent Set on the proximity graph classes relative neighborhood graphs, Gabriel graphs, and relatively closest graphs. We prove that all of the problems remain NP-hard on these graphs, except for 3-Colorability and Hamiltonian Cycle on relatively closest graphs, where the former is trivial and the latter is left open. Moreover, for every NP-hard case we additionally show that no $2^{o(n^{1/4})}$-time algorithm exists unless the ETH fails, where n denotes the number of vertices.
- Published
- 2021
20. Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
- Author
-
Rymar, Maciej, Molter, Hendrik, Nichterlein, André, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics - Abstract
In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality is efficiently computable and it is a fundamental tool in network science. Continuing and extending previous work, we study the efficient computability of betweenness centrality in temporal graphs (graphs with fixed vertex set but time-varying arc sets). Unlike in the static case, there are numerous natural notions of being a "shortest" temporal path (walk). Depending on which notion is used, it was already observed that the problem is #P-hard in some cases while polynomial-time solvable in others. In this conceptual work, we contribute towards classifying what a "shortest path (walk) concept" has to fulfill in order to gain polynomial-time computability of temporal betweenness centrality.
- Published
- 2021
21. On Finding Separators in Temporal Split and Permutation Graphs
- Author
-
Maack, Nicolas, Molter, Hendrik, Niedermeier, Rolf, and Renken, Malte
- Subjects
Computer Science - Discrete Mathematics ,Computer Science - Data Structures and Algorithms - Abstract
Removing all connections between two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s,z)-separation problem is well-known to be polynomial solvable and serves as an important primitive in many applications related to network connectivity. We study the NP-hard temporal (s,z)-separation problem on temporal graphs, which are graphs with fixed vertex sets but edge sets that change over discrete time steps. We tackle this problem by restricting the layers (i.e., graphs characterized by edges that are present at a certain point in time) to specific graph classes. We restrict the layers of the temporal graphs to be either all split graphs or all permutation graphs (both being perfect graph classes) and provide both intractability and tractability results. In particular, we show that in general the problem remains NP-hard both on temporal split and temporal permutation graphs, but we also spot promising islands of fixed-parameter tractability particularly based on parameterizations that measure the amount of "change over time".
- Published
- 2021
22. Interference-free Walks in Time: Temporally Disjoint Paths
- Author
-
Klobas, Nina, Mertzios, George B., Molter, Hendrik, Niedermeier, Rolf, and Zschoche, Philipp
- Subjects
Computer Science - Data Structures and Algorithms ,Mathematics - Combinatorics - Abstract
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically increasing time steps. Two paths (or walks) are temporally disjoint if they never use the same vertex at the same time; otherwise, they interfere. This reflects applications in robotics, traffic routing, or finding safe pathways in dynamically changing networks. On the one extreme, we show that on general graphs the problem is computationally hard. The "walk version" is W[1]-hard when parameterized by the number of routes. However, it is polynomial-time solvable for any constant number of walks. The "path version" remains NP-hard even if we want to find only two temporally disjoint paths. On the other extreme, restricting the input temporal graph to have a path as underlying graph, quite counterintuitively, we find NP-hardness in general but also identify natural tractable cases.
- Published
- 2021
23. The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality
- Author
-
Froese, Vincent, Hertrich, Christoph, and Niedermeier, Rolf
- Subjects
Computer Science - Machine Learning ,Computer Science - Computational Complexity ,Computer Science - Data Structures and Algorithms ,Computer Science - Neural and Evolutionary Computing ,Statistics - Machine Learning - Abstract
Understanding the computational complexity of training simple neural networks with rectified linear units (ReLUs) has recently been a subject of intensive research. Closing gaps and complementing results from the literature, we present several results on the parameterized complexity of training two-layer ReLU networks with respect to various loss functions. After a brief discussion of other parameters, we focus on analyzing the influence of the dimension $d$ of the training data on the computational complexity. We provide running time lower bounds in terms of W[1]-hardness for parameter $d$ and prove that known brute-force strategies are essentially optimal (assuming the Exponential Time Hypothesis). In comparison with previous work, our results hold for a broad(er) range of loss functions, including $\ell^p$-loss for all $p\in[0,\infty]$. In particular, we extend a known polynomial-time algorithm for constant $d$ and convex loss functions to a more general class of loss functions, matching our running time lower bounds also in these cases.
- Published
- 2021
- Full Text
- View/download PDF
24. Putting a Compass on the Map of Elections
- Author
-
Boehmer, Niclas, Bredereck, Robert, Faliszewski, Piotr, Niedermeier, Rolf, and Szufa, Stanisław
- Subjects
Computer Science - Computer Science and Game Theory ,Economics - Econometrics - Abstract
Recently, Szufa et al. [AAMAS 2020] presented a "map of elections" that visualizes a set of 800 elections generated from various statistical cultures. While similar elections are grouped together on this map, there is no obvious interpretation of the elections' positions. We provide such an interpretation by introducing four canonical "extreme" elections, acting as a compass on the map. We use them to analyze both a dataset provided by Szufa et al. and a number of real-life elections. In effect, we find a new variant of the Mallows model and show that it captures real-life scenarios particularly well., Comment: Accepted to IJCAI 2021
- Published
- 2021
25. Optimal Virtual Network Embeddings for Tree Topologies
- Author
-
Figiel, Aleksander, Kellerhals, Leon, Niedermeier, Rolf, Rost, Matthias, Schmid, Stefan, and Zschoche, Philipp
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Networking and Internet Architecture - Abstract
The performance of distributed and data-centric applications often critically depends on the interconnecting network. Applications are hence modeled as virtual networks, also accounting for resource demands on links. At the heart of provisioning such virtual networks lies the NP-hard Virtual Network Embedding Problem (VNEP): how to jointly map the virtual nodes and links onto a physical substrate network at minimum cost while obeying capacities. This paper studies the VNEP in the light of parameterized complexity. We focus on tree topology substrates, a case often encountered in practice and for which the VNEP remains NP-hard. We provide the first fixed-parameter algorithm for the VNEP with running time $O(3^r (s+r^2))$ for requests and substrates of $r$ and $s$ nodes, respectively. In a computational study our algorithm yields running time improvements in excess of 200x compared to state-of-the-art integer programming approaches. This makes it comparable in speed to the well-established ViNE heuristic while providing optimal solutions. We complement our algorithmic study with hardness results for the VNEP and related problems., Comment: An extended abstract of this work appears in the Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '21)
- Published
- 2021
26. Equilibria in Schelling Games: Computational Hardness and Robustness
- Author
-
Kreisel, Luca, Boehmer, Niclas, Froese, Vincent, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory - Abstract
In the simplest game-theoretic formulation of Schelling's model of segregation on graphs, agents of two different types each select their own vertex in a given graph so as to maximize the fraction of agents of their type in their occupied neighborhood. Two ways of modeling agent movement here are either to allow two agents to swap their vertices or to allow an agent to jump to a free vertex. The contributions of this paper are twofold. First, we prove that deciding the existence of a swap-equilibrium and a jump-equilibrium in this simplest model of Schelling games is NP-hard, thereby answering questions left open by Agarwal et al. [AAAI '20] and Elkind et al. [IJCAI '19]. Second, we introduce two measures for the robustness of equilibria in Schelling games in terms of the minimum number of edges or the minimum number of vertices that need to be deleted to make an equilibrium unstable. We prove tight lower and upper bounds on the edge- and vertex-robustness of swap-equilibria in Schelling games on different graph classes., Comment: Accepted to AAMAS'22
- Published
- 2021
27. Two Influence Maximization Games on Graphs Made Temporal
- Author
-
Boehmer, Niclas, Froese, Vincent, Henkel, Julia, Lasars, Yvonne, Niedermeier, Rolf, and Renken, Malte
- Subjects
Computer Science - Computer Science and Game Theory - Abstract
To address the dynamic nature of real-world networks, we generalize competitive diffusion games and Voronoi games from static to temporal graphs, where edges may appear or disappear over time. This establishes a new direction of studies in the area of graph games, motivated by applications such as influence spreading. As a first step, we investigate the existence of Nash equilibria in 2-player competitive diffusion and Voronoi games on different temporal graph classes. Even when restricting our studies to temporal trees and cycles, this turns out to be a challenging undertaking, revealing significant differences between the two games in the temporal setting. Notably, both games are equivalent on static trees and cycles. Our two main technical results are (algorithmic) proofs for the existence of Nash equilibria in 2-player competitive diffusion and temporal Voronoi games when the edges are restricted not to disappear over time., Comment: Accepted to IJCAI 2021
- Published
- 2021
28. Multistage s–t Path: Confronting Similarity with Dissimilarity
- Author
-
Fluschnik, Till, Niedermeier, Rolf, Schubert, Carsten, and Zschoche, Philipp
- Published
- 2023
- Full Text
- View/download PDF
29. Approximating sparse quadratic programs
- Author
-
Hermelin, Danny, Kellerhals, Leon, Niedermeier, Rolf, and Pugatch, Rami
- Published
- 2024
- Full Text
- View/download PDF
30. A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem
- Author
-
Bentert, Matthias, Bredereck, Robert, Györgyi, Péter, Kaczmarczyk, Andrzej, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,F.2.2 ,G.2.1 ,I.2.8 ,I.1.2 - Abstract
The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related problems have been thoroughly studied since the 1980's. Roughly speaking, the problem deals with minimizing the makespan when scheduling jobs that consume non-renewable resources. We focus on the single-machine case without preemption: from time to time, the resources of the machine are (partially) replenished, thus allowing for meeting a necessary pre-condition for processing further jobs, each of which having individual resource demands. We initiate a systematic exploration of the parameterized (exact) complexity landscape of the problem, providing parameterized tractability as well as intractability results. Doing so, we mainly investigate how parameters related to the resource supplies influence the computational solvability. Thereby, we get a deepened understanding of the algorithmic complexity of this fundamental scheduling problem., Comment: Accepted for publication in The Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21)
- Published
- 2021
31. A Refined Complexity Analysis of Fair Districting over Graphs
- Author
-
Boehmer, Niclas, Koana, Tomohiro, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Discrete Mathematics - Abstract
We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in every district the most frequent color occurs at most a given number of times more often than the second most frequent color. Fair Connected Districting is motivated by various real-world scenarios where agents of different types, which are one-to-one represented by nodes in a network, have to be partitioned into disjoint districts. Herein, one strives for "fair districts" without any type being in a dominating majority in any of the districts. This is to e.g. prevent segregation or political domination of some political party. We conduct a fine-grained analysis of the (parameterized) computational complexity of Fair Connected Districting. In particular, we prove that it is polynomial-time solvable on paths, cycles, stars, and caterpillars, but already becomes NP-hard on trees. Motivated by the latter negative result, we perform a parameterized complexity analysis with respect to various graph parameters, including treewidth, and problem-specific parameters, including, the numbers of colors and districts. We obtain a rich and diverse, close to complete picture of the corresponding parameterized complexity landscape (that is, a classification along the complexity classes FPT, XP, W[1]-hard, and para-NP-hard).
- Published
- 2021
32. The Complexity of Gerrymandering Over Graphs: Paths and Trees
- Author
-
Bentert, Matthias, Koana, Tomohiro, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics - Abstract
Roughly speaking, gerrymandering is the systematic manipulation of the boundaries of electoral districts to make a specific (political) party win as many districts as possible. While typically studied from a geographical point of view, addressing social network structures, the investigation of gerrymandering over graphs was recently initiated by Cohen-Zemach et al. [AAMAS 2018]. Settling three open questions of Ito et al. [AAMAS 2019], we classify the computational complexity of the NP-hard problem Gerrymandering over Graphs when restricted to paths and trees. Our results, which are mostly of negative nature (that is, worst-case hardness), in particular yield two complexity dichotomies for trees. For instance, the problem is polynomial-time solvable for two parties but becomes weakly NP-hard for three. Moreover, we show that the problem remains NP-hard even when the input graph is a path.
- Published
- 2021
33. Envy-Free Allocations Respecting Social Networks
- Author
-
Bredereck, Robert, Kaczmarczyk, Andrzej, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Multiagent Systems - Abstract
Finding an envy-free allocation of indivisible resources to agents is a central task in many multiagent systems. Often, non-trivial envy-free allocations do not exist, and, when they do, finding them can be computationally hard. Classical envy-freeness requires that every agent likes the resources allocated to it at least as much as the resources allocated to any other agent. In many situations this assumption can be relaxed since agents often do not even know each other. We enrich the envy-freeness concept by taking into account (directed) social networks of the agents. Thus, we require that every agent likes its own allocation at least as much as those of all its (out)neighbors. This leads to a "more local" concept of envy-freeness. We also consider a "strong" variant where every agent must like its own allocation more than those of all its (out)neighbors. We analyze the classical and the parameterized complexity of finding allocations that are complete and, at the same time, envy-free with respect to one of the variants of our new concept. To this end, we study different restrictions of the agents' preferences and of the social network structure. We identify cases that become easier (from $\Sigma^\textrm{p}_2$-hard or NP-hard to polynomial-time solvability) and cases that become harder (from polynomial-time solvability to NP-hard) when comparing classical envy-freeness with our graph envy-freeness. Furthermore, we spot cases where graph envy-freeness is easier to decide than strong graph envy-freeness, and vice versa. On the route to one of our fixed-parameter tractability results, we also establish a connection to a directed and colored variant of the classical SUBGRAPH ISOMORPHISM problem, thereby extending a known fixed-parameter tractability result for the latter., Comment: 49 pages; 7 figures; A preliminary version of this article appeared in the Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'18)
- Published
- 2020
34. Equitable scheduling on a single machine
- Author
-
Heeger, Klaus, Hermelin, Danny, Mertzios, George B., Molter, Hendrik, Niedermeier, Rolf, and Shabtay, Dvir
- Published
- 2023
- Full Text
- View/download PDF
35. On the Robustness of Winners: Counting Briberies in Elections
- Author
-
Boehmer, Niclas, Bredereck, Robert, Faliszewski, Piotr, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory - Abstract
We study the parameterized complexity of counting variants of Swap- and Shift-Bribery problems, focusing on the parameterizations by the number of swaps and the number of voters. We show experimentally that Swap-Bribery offers a new approach to the robustness analysis of elections.
- Published
- 2020
36. Equitable Scheduling on a Single Machine
- Author
-
Heeger, Klaus, Hermelin, Danny, Mertzios, George B., Molter, Hendrik, Niedermeier, Rolf, and Shabtay, Dvir
- Subjects
Computer Science - Discrete Mathematics ,Computer Science - Data Structures and Algorithms - Abstract
We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalization lies in simultaneously considering several instances of the problem at once. In particular, we have $n$ clients over a period of $m$ days, where each client has a single job with its own processing time and deadline per day. Our goal is to provide a schedule for each of the $m$ days, so that each client is guaranteed to have their job meet its deadline in at least $k \le m$ days. This corresponds to an equitable schedule where each client is guaranteed a minimal level of service throughout the period of $m$ days. We provide a thorough analysis of the computational complexity of three main variants of this problem, identifying both efficient algorithms and worst-case intractability results.
- Published
- 2020
37. Multidimensional Stable Roommates with Master List
- Author
-
Bredereck, Robert, Heeger, Klaus, Knop, Dušan, and Niedermeier, Rolf
- Subjects
Computer Science - Computational Complexity ,Computer Science - Computer Science and Game Theory - Abstract
Since the early days of research in algorithms and complexity, the computation of stable matchings is a core topic. While in the classic setting the goal is to match up two agents (either from different "gender" (this is Stable Marriage) or "unrestricted" (this is Stable Roommates)), Knuth [1976] triggered the study of three- or multidimensional cases. Here, we focus on the study of Multidimensional Stable Roommates, known to be NP-hard since the early 1990's. Many NP-hardness results, however, rely on very general input instances that do not occur in at least some of the specific application scenarios. With the quest for identifying islands of tractability for Multidimensional Stable Roommates, we study the case of master lists. Here, as natural in applications where agents express their preferences based on "objective" scores, one roughly speaking assumes that all agent preferences are "derived from" a central master list, implying that the individual agent preferences shall be similar. Master lists have been frequently studied in the two-dimensional (classic) stable matching case, but seemingly almost never for the multidimensional case. This work, also relying on methods from parameterized algorithm design and complexity analysis, performs a first systematic study of Multidimensional Stable Roommates under the assumption of master lists.
- Published
- 2020
38. Line-Up Elections: Parallel Voting with Shared Candidate Pool
- Author
-
Boehmer, Niclas, Bredereck, Robert, Faliszewski, Piotr, Kaczmarczyk, Andrzej, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Economics - Theoretical Economics - Abstract
We introduce the model of line-up elections which captures parallel or sequential single-winner elections with a shared candidate pool. The goal of a line-up election is to find a high-quality assignment of a set of candidates to a set of positions such that each position is filled by exactly one candidate and each candidate fills at most one position. A score for each candidate-position pair is given as part of the input, which expresses the qualification of the candidate to fill the position. We propose several voting rules for line-up elections and analyze them from an axiomatic and an empirical perspective using real-world data from the popular video game FIFA., Comment: Accepted to SAGT 2020
- Published
- 2020
39. Bribery and Control in Stable Marriage
- Author
-
Boehmer, Niclas, Bredereck, Robert, Heeger, Klaus, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Discrete Mathematics - Abstract
We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals. For instance, one goal is to make sure that a given pair of agents is matched in a stable solution, and this may be achieved by the manipulative action of reordering some agents' preference lists. We present a comprehensive study of the computational complexity of all problems arising in this way. We find several polynomial-time solvable cases as well as NP-hard ones. For the NP-hard cases, focusing on the natural parameter budget (that is, the number of manipulative actions one is allowed to perform), we also conduct a parameterized complexity analysis and encounter mostly parameterized hardness results., Comment: Accepted for publication at the Journal of Artificial Intelligence Research (JAIR)
- Published
- 2020
40. Approximating Sparse Quadratic Programs
- Author
-
Hermelin, Danny, Kellerhals, Leon, Niedermeier, Rolf, and Pugatch, Rami
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
Given a matrix $A \in \mathbb{R}^{n\times n}$, we consider the problem of maximizing $x^TAx$ subject to the constraint $x \in \{-1,1\}^n$. This problem, called MaxQP by Charikar and Wirth [FOCS'04], generalizes MaxCut and has natural applications in data clustering and in the study of disordered magnetic phases of matter. Charikar and Wirth showed that the problem admits an $\Omega(1/\lg n)$ approximation via semidefinite programming, and Alon, Makarychev, Makarychev, and Naor [STOC'05] showed that the same approach yields an $\Omega(1)$ approximation when $A$ corresponds to a graph of bounded chromatic number. Both these results rely on solving the semidefinite relaxation of MaxQP, whose currently best running time is $\tilde{O}(n^{1.5}\cdot \min\{N,n^{1.5}\})$, where $N$ is the number of nonzero entries in $A$ and $\tilde{O}$ ignores polylogarithmic factors. In this sequel, we abandon the semidefinite approach and design purely combinatorial approximation algorithms for special cases of MaxQP where $A$ is sparse (i.e., has $O(n)$ nonzero entries). Our algorithms are superior to the semidefinite approach in terms of running time, yet are still competitive in terms of their approximation guarantees. More specifically, we show that: - MaxQP admits a $(1/2\Delta)$-approximation in $O(n \lg n)$ time, where $\Delta$ is the maximum degree of the corresponding graph. - UnitMaxQP, where $A \in \{-1,0,1\}^{n\times n}$, admits a $(1/2d)$-approximation in $O(n)$ time when the corresponding graph is $d$-degenerate, and a $(1/3\delta)$-approximation in $O(n^{1.5})$ time when the corresponding graph has $\delta n$ edges. - MaxQP admits a $(1-\varepsilon)$-approximation in $O(n)$ time when the corresponding graph and each of its minors have bounded local treewidth. - UnitMaxQP admits a $(1-\varepsilon)$-approximation in $O(n^2)$ time when the corresponding graph is $H$-minor free.
- Published
- 2020
41. On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
- Author
-
Figiel, Aleksander, Himmel, Anne-Sophie, Nichterlein, André, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
Editing a graph into a disjoint union of clusters is a standard optimization task in graph-based data clustering. Here, complementing classic work where the clusters shall be cliques, we focus on clusters that shall be 2-clubs, that is, subgraphs of diameter two. This naturally leads to the two NP-hard problems 2-Club Cluster Editing (the allowed editing operations are edge insertion and edge deletion) and 2-Club Cluster Vertex Deletion (the allowed editing operations are vertex deletions). Answering an open question from the literature, we show that 2-Club Cluster Editing is W[2]-hard with respect to the number of edge modifications, thus contrasting the fixed-parameter tractability result for the classic Cluster Editing problem (considering cliques instead of 2-clubs). Then focusing on 2-Club Cluster Vertex Deletion, which is easily seen to be fixed-parameter tractable, we show that under standard complexity-theoretic assumptions it does not have a polynomial-size problem kernel when parameterized by the number of vertex deletions. Nevertheless, we develop several effective data reduction and pruning rules, resulting in a competitive solver, clearly outperforming a standard CPLEX solver in most instances of an established biological test data set.
- Published
- 2020
42. Algorithmic Aspects of Temporal Betweenness
- Author
-
Buß, Sebastian, Molter, Hendrik, Niedermeier, Rolf, and Rymar, Maciej
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics - Abstract
The betweenness centrality of a graph vertex measures how often this vertex is visited on shortest paths between other vertices of the graph. In the analysis of many real-world graphs or networks, betweenness centrality of a vertex is used as an indicator for its relative importance in the network. In particular, it is among the most popular tools in social network analysis. In recent years, a growing number of real-world networks is modeled as temporal graphs, where we have a fixed set of vertices and there is a finite discrete set of time steps and every edge might be present only at some time steps. While shortest paths are straightforward to define in static graphs, temporal paths can be considered "optimal" with respect to many different criteria, including length, arrival time, and overall travel time (shortest, foremost, and fastest paths). This leads to different concepts of temporal betweenness centrality and we provide a systematic study of temporal betweenness variants based on various concepts of optimal temporal paths. Computing the betweenness centrality for vertices in a graph is closely related to counting the number of optimal paths between vertex pairs. We show that counting foremost and fastest paths is computationally intractable (#P-hard) and hence the computation of the corresponding temporal betweenness values is intractable as well. For shortest paths and two selected special cases of foremost paths, we devise polynomial-time algorithms for temporal betweenness computation. Moreover, we also explore the distinction between strict (ascending time labels) and non-strict (non-descending time labels) time labels in temporal paths. In our experiments with established real-world temporal networks, we demonstrate the practical effectiveness of our algorithms, compare the various betweenness concepts, and derive recommendations on their practical use.
- Published
- 2020
- Full Text
- View/download PDF
43. High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
- Author
-
Bredereck, Robert, Kaczmarczyk, Andrzej, Knop, Dušan, and Niedermeier, Rolf
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Data Structures and Algorithms ,F.2.2 - Abstract
Using insights from parametric integer linear programming, we significantly improve on our previous work [Proc. ACM EC 2019] on high-multiplicity fair allocation. Therein, answering an open question from previous work, we proved that the problem of finding envy-free Pareto-efficient allocations of indivisible items is fixed-parameter tractable with respect to the combined parameter "number of agents" plus "number of item types." Our central improvement, compared to this result, is to break the condition that the corresponding utility and multiplicity values have to be encoded in unary required there. Concretely, we show that, while preserving fixed-parameter tractability, these values can be encoded in binary, thus greatly expanding the range of feasible values., Comment: 15 pages; Published in the Proceedings of ECAI-2023
- Published
- 2020
44. As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Author
-
Fluschnik, Till, Molter, Hendrik, Niedermeier, Rolf, Renken, Malte, and Zschoche, Philipp
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics - Abstract
Treewidth is arguably the most important structural graph parameter leading to algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in temporal networks (graphs where edge sets change over time), we discuss fresh algorithmic views on temporal tree decompositions and temporal treewidth. We review and explain some of the recent work together with some encountered pitfalls, and we point out challenges for future research.
- Published
- 2020
- Full Text
- View/download PDF
45. Feedback Edge Sets in Temporal Graphs
- Author
-
Haag, Roman, Molter, Hendrik, Niedermeier, Rolf, and Renken, Malte
- Subjects
Computer Science - Discrete Mathematics ,Computer Science - Data Structures and Algorithms - Abstract
The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in a (static, unweighted) graph. We provide a first study of this problem in the setting of temporal graphs, where edges are present only at certain points in time. We find that there are four natural generalizations of Feedback Edge Set, all of which turn out to be NP-hard. We also study the tractability of these problems with respect to several parameters (solution size, lifetime, and number of graph vertices, among others) and obtain some parameterized hardness but also fixed-parameter tractability results.
- Published
- 2020
46. Multistage s-t Path: Confronting Similarity with Dissimilarity
- Author
-
Fluschnik, Till, Niedermeier, Rolf, Schubert, Carsten, and Zschoche, Philipp
- Subjects
Computer Science - Computational Complexity ,Computer Science - Data Structures and Algorithms ,68R10, 68Q17, 68Q25, 68W40 - Abstract
Addressing a quest by Gupta et al. [ICALP'14], we provide a first, comprehensive study of finding a short s-t path in the multistage graph model, referred to as the Multistage s-t Path problem. Herein, given a sequence of graphs over the same vertex set but changing edge sets, the task is to find short s-t paths in each graph ("snapshot") such that in the found path sequence the consecutive s-t paths are "similar". We measure similarity by the size of the symmetric difference of either the vertex set (vertex-similarity) or the edge set (edge-similarity) of any two consecutive paths. We prove that these two variants of Multistage s-t Path are already NP-hard for an input sequence of only two graphs and maximum vertex degree four. Motivated by this fact and natural applications of this scenario e.g. in traffic route planning, we perform a parameterized complexity analysis. Among other results, for both variants, vertex- and edge-similarity, we prove parameterized hardness (W[1]-hardness) regarding the parameter path length (solution size) for both variants, vertex- and edge-similarity. As a further conceptual study, we then modify the multistage model by asking for dissimilar consecutive paths. As one of the main technical results (employing so-called representative sets known from non-temporal settings), we prove that dissimilarity allows for fixed-parameter tractability for the parameter solution size, contrasting our W[1]-hardness proof of the corresponding similarity case. We also provide partially positive results concerning efficient and effective data reduction (kernelization).
- Published
- 2020
47. The Complexity of Binary Matrix Completion Under Diameter Constraints
- Author
-
Koana, Tomohiro, Froese, Vincent, and Niedermeier, Rolf
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics ,F.2.2 - Abstract
We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range. We obtain an almost complete picture of the complexity landscape regarding the distance constraints and the maximum number of missing entries in any row. We develop polynomial-time algorithms for maximum diameter three based on Deza's theorem [Discret. Math. 1973] from extremal set theory. We also prove NP-hardness for diameter at least four. For the number of missing entries per row, we show polynomial-time solvability when there is only one and NP-hardness when there can be at least two. In many of our algorithms, we heavily rely on Deza's theorem to identify sunflower structures. This paves the way towards polynomial-time algorithms which are based on finding graph factors and solving 2-SAT instances.
- Published
- 2020
48. Faster Binary Mean Computation Under Dynamic Time Warping
- Author
-
Schaar, Nathan, Froese, Vincent, and Niedermeier, Rolf
- Subjects
Computer Science - Discrete Mathematics ,Computer Science - Data Structures and Algorithms - Abstract
Many consensus string problems are based on Hamming distance. We replace Hamming distance by the more flexible (e.g., easily coping with different input string lengths) dynamic time warping distance, best known from applications in time series mining. Doing so, we study the problem of finding a mean string that minimizes the sum of (squared) dynamic time warping distances to a given set of input strings. While this problem is known to be NP-hard (even for strings over a three-element alphabet), we address the binary alphabet case which is known to be polynomial-time solvable. We significantly improve on a previously known algorithm in terms of worst-case running time. Moreover, we also show the practical usefulness of one of our algorithms in experiments with real-world and synthetic data. Finally, we identify special cases solvable in linear time (e.g., finding a mean of only two binary input strings) and report some empirical findings concerning combinatorial properties of optimal means.
- Published
- 2020
49. Parameterized Algorithms for Matrix Completion With Radius Constraints
- Author
-
Koana, Tomohiro, Froese, Vincent, and Niedermeier, Rolf
- Subjects
Computer Science - Discrete Mathematics ,F.2.2 - Abstract
Considering matrices with missing entries, we study NP-hard matrix completion problems where the resulting completed matrix shall have limited (local) radius. In the pure radius version, this means that the goal is to fill in the entries such that there exists a 'center string' which has Hamming distance to all matrix rows as small as possible. In stringology, this problem is also known as Closest String with Wildcards. In the local radius version, the requested center string must be one of the rows of the completed matrix. Hermelin and Rozenberg [CPM 2014, TCS 2016] performed parameterized complexity studies for Closest String with Wildcards. We answer one of their open questions, fix a bug concerning a fixed-parameter tractability result in their work, and improve some upper running time bounds. For the local radius case, we reveal a computational complexity dichotomy. In general, our results indicate that, although being NP-hard as well, this variant often allows for faster (fixed-parameter) algorithms.
- Published
- 2020
50. Multistage Graph Problems on a Global Budget
- Author
-
Heeger, Klaus, Himmel, Anne-Sophie, Kammer, Frank, Niedermeier, Rolf, Renken, Malte, and Sajenko, Andrej
- Subjects
Computer Science - Computational Complexity ,Computer Science - Data Structures and Algorithms - Abstract
Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is among the most natural frameworks. Roughly speaking, herein one studies the different (time) layers of a temporal graph (effectively meaning that the edge set may change over time, but the vertex set remains unchanged), and one searches for a solution of a given graph problem for each layer. The twist in the multistage setting is that the solutions found must not differ too much between subsequent layers. We relax on this already established notion by introducing a global instead of the local budget view studied so far. More specifically, we allow for few disruptive changes between subsequent layers but request that overall, that is, summing over all layers, the degree of change is moderate. Studying several classical graph problems (both NP-hard and polynomial-time solvable ones) from a parameterized complexity angle, we encounter both fixed-parameter tractability and parameterized hardness results. Somewhat surprisingly, we find that sometimes the global multistage versions of NP-hard problems such as Vertex Cover turn out to be computationally more tractable than the ones of polynomial-time solvable problems such as Matching.
- Published
- 2019
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.