Related papers: On the complexity of a maintenance problem for hie…

State minimization of combinatorial filters is a fundamental problem that arises, for example, in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard. This paper conducts a more nuanced analysis of this…

This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this external resource are executed only when the external resource is available. There…

We analyze two consequences of the relationship between collinear factorization and $k_t$-factorization. First, we show that the $k_t$-factorization gives a fundamental justification for the choice of the hard scale $Q^2$ done in the…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…

We study the optimization version of the set partition problem (where the difference between the partition sums are minimized), which has numerous applications in decision theory literature. While the set partitioning problem is NP-hard and…

The first-order (FO) model checking problem asks, given an FO sentence $\phi$ and a graph $G$, whether $G$ is a model of $\phi$. This problem is known to be $\mathsf{AW[*]}$-hard when parameterized by the quantifier rank of the formula. A…

Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing…

In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has been done, the problem reduces to well understood uniprocessor…

Natural disasters, such as hurricanes, earthquakes and large wind or ice storms, typically require the repair of a large number of components in electricity distribution networks. Since power cannot be restored before these repairs have…

A proof is given that hard-scattering factorization is valid for deep-inelastic processes which are diffractive or which have some other condition imposed on the final state in the target fragmentation region.

We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…

Throughout this article we develop and change the definitions and the ideas in "arXiv:1006.4939", in order to consider the efficiency of functions and complexity time problems. The central idea here is effective enumeration and listing, and…

We consider hierarchical variational inequality problems, or more generally, variational inequalities defined over the set of zeros of a monotone operator. This framework includes convex optimization over equilibrium constraints and…

This paper approaches, using structural complexity theory, the question of whether there is a chasm between knowing an object exists and getting one's hands on the object or its properties. In particular, we study the nontransparency of…

An adaptive isogeometric method based on $d$-variate hierarchical spline constructions can be derived by considering a refine module that preserves a certain class of admissibility between two consecutive steps of the adaptive loop [6]. In…

Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems appeared. They addressed many heuristics and enumerative procedures, complexity results or…

This paper investigates the robust stability and stabilization analysis of interval fractional-order systems with time-varying delay. The stability problem of such systems is solved first, and then using the proposed results a stabilization…

Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs $(N, \unlhd)$. A job $j \in N$ is available for scheduling, if all jobs $i \in N$ with $i \unlhd j$ are…

In this note we study multiple-ratio fractional 0--1 programs, a broad class of NP-hard combinatorial optimization problems. In particular, under some relatively mild assumptions we provide a complete characterization of the conditions,…

The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support…