computational complexity
Volume 1 / 1991 - Volume 26 / 2017
Page
%P
136,469 Result(s)
-
Article
On the Approximability of Digraph Ordering
Given an n-vertex digraph \(D = (V, A)\) D ...
-
Article
Upper Domination: Towards a Dichotomy Through Boundary Properties
An upper dominating set in a graph is a minimal dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in finitely d...
-
Journal
-
Article
Evaluation of Circuits Over Nilpotent and Polycyclic Groups
We study the circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups. The best upper bound for this problem is coRP (the complements of problems in randomized p...
-
Article
Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables
The most common representation in evolutionary computation are bit strings. With very little theoretical work existing on how to use evolutionary algorithms for decision variables taking more than two values, ...
-
Article
The Average Sensitivity of Bounded-Depth Formulas
We show that unbounded fan-in Boolean formulas of depth d + 1 and size s have average sensitivity \({O(\frac{1}{d} \log s)^d}\) ...
-
Article
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions
In this paper we continue our study of graph modification problems defined by reducing the rank of the adjacency matrix of the given graph, and extend our results from undirected graphs to modifying the rank o...
-
Article
FPTAS for Minimizing the Earth Mover’s Distance Under Rigid Transformations and Related Problems
In this paper, we consider the problem (denoted as EMDRT) of minimizing the earth mover’s distance between two sets of weighted points A and B in ...
-
Article
On the Succinct Representation of Equivalence Classes
Given a partition of an n element set into equivalence classes, we study the problem of assigning unique labels to these elements in order to support the query that asks whether the elements corresponding to two ...
-
Article
Asynchronous Rumor Spreading on Random Graphs
We perform a thorough study of various characteristics of the asynchronous push–pull protocol for spreading a rumor on Erdős–Rényi random graphs ...
-
Article
Primal–Dual Algorithms for Precedence Constrained Covering Problems
A covering problem is an integer linear program of type \(\min \{c^Tx\mid Ax\ge D,\ 0\le x\le d,\ x \in \mathbb {Z}\}\) ...
-
Article
Robustness of the Rotor–Router Mechanism
The rotor–router model, also called the Propp machine, was first considered as a deterministic alternative to the random walk. The edges adjacent to each node v (or equivalently, the exit ports at v) are arranged...
-
Article
Extending Partial Representations of Interval Graphs
Interval graphs are intersection graphs of closed intervals of the real-line. The well-known computational problem, called recognition, asks whether an input graph G can be represented by closed intervals, i.e., ...
-
Open Access This content is freely available online to anyone, anywhere at any time.
Article
Online Packet-Routing in Grids with Bounded Buffers
We present deterministic and randomized algorithms for the problem of online packet routing in grids in the competitive network throughput model (Aiello et al. in SODA, pp 771–780 2003). In this model the network...
-
Article
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted Identifying Code, (Open) Open Locating-Dominating Set and Metric Dimension) of an interva...
-
Article
Connectivity Graphs of Uncertainty Regions
We study connectivity relations among points, where the precise location of each input point lies in a region of uncertainty. We distinguish two fundamental scenarios under which uncertainty arises. In the fav...
-
Article
Stable Matching with Network Externalities
We study the stable roommates problem in networks where players are embedded in a social context and may incorporate positive externalities into their decisions. Each player is a node in a social network and s...
-
Article
Resolving Braess’s Paradox in Random Networks
Braess’s paradox states that removing a part of a network may improve the players’ latency at equilibrium. In this work, we study the approximability of the best subnetwork problem for the class of random ...
-
Article
On Computing an Optimal Semi-matching
A semi-matching in a bipartite graph \(G = (U, V, E)\) ...
-
Article
Improved Algorithms for Distributed Entropy Monitoring
Modern data management systems often need to deal with massive, dynamic and inherently distributed data sources. We collect the data using a distributed network, and at the same time try to maintain a global v...
