Algorithmica

We study a common delivery problem encountered in nowadays online food-ordering platforms: Customers order dishes online, and the restaurant delivers the food after receiving the order. Specifically, we study a problem where k vehicles of capacity ...$\mathrm{}$$$$\mathrm{}$$\mathrm{}$$$$$$$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$${}_{\mathsf{}}$${}_{\mathsf{}}$${}_{\mathsf{}}$${}_{\mathsf{}}$

Given a class of graphs $\mathcal{H}$, the problem $\oplus \text{Sub}(\mathcal{H})$ is defined as follows. The input is a graph $H\in \mathcal{H}$ together with an arbitrary graph G. The problem is to compute, modulo 2, the number of subgraphs of G that are isomorphic to H. The goal of this ...$\mathcal{}$$\mathcal{}$${}^{\mathrm{}}$$\mathcal{}$$\mathcal{}$$\mathcal{}$$\mathcal{}$$\mathcal{}$$\mathcal{}$

A subset of $[n]=\{1,2,\dots ,n\}$ is called stable if it forms an independent set in the cycle on the vertex set [n]. In 1978, Schrijver proved via a topological argument that for all integers n and k with $n\ge 2k$, the family of stable k-subsets of [n] ...$\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}$$$$\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}$$\mathsf{}$$\frac{}{\mathrm{}\mathrm{}}$$\mathrm{}\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}$$$${}_{\mathrm{}}{}_{}$$\mathrm{}\mathrm{}$${}_{}\mathrm{}$$$${}_{}{}_{}\mathrm{}$$$$\mathsf{}$$\mathrm{}$$$

Two recent lower bounds on the compressibility of repetitive sequences, $\delta \le \gamma$, have received much attention. It has been shown that a length-n string S over an alphabet of size $\sigma$ can be represented within the optimal $O(\delta log\frac{nlog\sigma }{\delta logn})$ space, and ...${}^{}$$\mathrm{}$$\mathrm{}{}^{}$$\frac{}{}$$$$\mathrm{}{}^{}$$\frac{}{}$${}^{\mathrm{}}$$\frac{}{}$$$

Given two matroids on the same ground set, the matroid intersection problem asks for a common base, i.e., a subset of the ground set that is a base in both the matroids. The weighted version of the problem asks for a common base with maximum ...

We study the problem of Regularized Unconstrained SubmodularMaximization (RegularizedUSM) as defined by Bodek and Feldman (Maximizing sums of non-monotone submodular and linear functions: understanding the unconstrained case, , ...${\mathrm{}}^{\mathcal{}}{\mathbb{}}_{\mathrm{}}$${\mathrm{}}^{\mathcal{}}\mathbb{}$$\mathcal{}$$\mathcal{}$$$$$$\mathbb{}{}_{\mathcal{}}$$$$$$$$$$$$\mathrm{}\mathrm{}$

In this work, we introduce a multi-vehicle (or multi-postman) extension of the classical Mixed Rural Postman Problem, which we call the Min–Max Mixed Rural Postmen Cover Problem (MRPCP). The MRPCP is defined on a mixed graph $G=(V,E,A)$, where V is ...$$$$$$$$$\mathrm{}$$$$\frac{\mathrm{}}{\mathrm{}}$$\frac{\mathrm{}}{\mathrm{}}$

In this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the ...

The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the data ...$\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}$

Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling ...

We consider reallocation problems in settings where the initial endowment of each agent consists of a subset of the resources. The private information of the players is their value for every possible subset of the resources. The goal is to ...

A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple input ...