• Algorithmica (IF 0.882) Pub Date : 2020-05-18
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés

We introduce the inverse Voronoi diagram problem in graphs: given a graph G with positive edge-lengths and a collection $${\mathbb {U}}$$ of subsets of vertices of V(G), decide whether $${\mathbb {U}}$$ is a Voronoi diagram in G with respect to the shortest-path metric. We show that the problem is NP-hard, even for planar graphs where all the edges have unit length. We also study the parameterized

更新日期：2020-05-18
• Algorithmica (IF 0.882) Pub Date : 2020-05-18
Shi Li, Jinhui Xu, Minwei Ye

The problem of truth discovery arises in many areas such as database, data mining, data crowdsourcing and machine learning. It seeks trustworthy information from possibly conflicting data provided by multiple sources. Due to its practical importance, the problem has been studied extensively in recent years. Two competing models were proposed for truth discovery, weight-based model and probabilistic

更新日期：2020-05-18
• Algorithmica (IF 0.882) Pub Date : 2020-05-16
Mingyu Xiao, Hiroshi Nagamochi

A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple $$(T,w, d_{\min },d_{\max })$$ of a tree T whose leaf set is equal to the vertex set of G, a non-negative edge weight w, and two non-negative reals $$d_{\min }\le d_{\max }$$ such that G has an edge between two vertices $$u,v\in V$$ if and only if the distance between the two leaves u and v in the weighted tree

更新日期：2020-05-16
• Algorithmica (IF 0.882) Pub Date : 2020-05-14
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli

We prove that, given two topologically-equivalent upward planar straight-line drawings of an n-vertex directed graph G, there always exists a morph between them such that all the intermediate drawings of the morph are upward planar and straight-line. Such a morph consists of O(1) morphing steps if G is a reduced planar st-graph, O(n) morphing steps if G is a planar st-graph, O(n) morphing steps if

更新日期：2020-05-14
• Algorithmica (IF 0.882) Pub Date : 2020-05-10

In this work we study the problem of collecting protected data in ad-hoc sensor network using a mobile entity called MULE. The objective is to increase information survivability in the network. Sensors from all over the network, route their sensing data through a data gathering tree, towards a particular node, called the sink. In case of a failed sensor, all the aggregated data from the sensor and

更新日期：2020-05-10
• Algorithmica (IF 0.882) Pub Date : 2020-05-08
Roland Glück, Dominik Köppl

This paper is dedicated to the counting problem of writing an integer number z as a sum of an ordered sequence of n integers from n given intervals, i.e., counting the number of configurations $$(z_1,\ldots ,z_n)$$ with $$z = z_1 + \cdots + z_n$$ for $$z_i \in [x_i, y_i]$$ with integers $$x_i$$ and $$y_i$$ and $$1 \le i \le n$$. We show an algorithm computing this number in $$\mathop {}\mathopen {}{\mathcal 更新日期：2020-05-08 • Algorithmica (IF 0.882) Pub Date : 2020-02-19 Qian Li, Xiaoming Sun, Jialin Zhang The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp (Sorting Search 3:197–207, 1999) independently discovered that the tape merge algorithm is optimal in the worst case when the two lists have the same size. In their seminal papers, Stockmeyer and Yao (SIAM J Comput 9(1):85–90, 1980), Murphy and Paull 更新日期：2020-02-19 • Algorithmica (IF 0.882) Pub Date : 2020-02-17 Travis Gagie, Meng He, Gonzalo Navarro In the range \(\alpha$$-majority query problem, we are given a sequence $$S[1\ldots n]$$ and a fixed threshold $$\alpha \in (0, 1)$$, and are asked to preprocess S such that, given a query range $$[i\ldots j]$$, we can efficiently report the symbols that occur more than $$\alpha (j-i+1)$$ times in $$S[i\ldots j]$$, which are called the range $$\alpha$$-majorities. In this article we describe the first

更新日期：2020-02-17
• Algorithmica (IF 0.882) Pub Date : 2020-02-14
Huang-Ting Chan, Hsuan-Tsung Chiu, Chang-Biau Yang, Yung-Hsing Peng

The similarity of two one-dimensional sequences is usually measured by the longest common subsequence (LCS) algorithms. However, these algorithms cannot be directly extended to solve the two or higher dimensional data. Thus, for the two-dimensional data, computing the similarity with an LCS-like approach remains worthy of investigation. In this paper, we utilize a systematic way to give the generalized

更新日期：2020-02-14
• Algorithmica (IF 0.882) Pub Date : 2020-02-13
Naoyuki Kamiyama

Alamdari and Shmoys introduced the following variant of the k-median problem. In this variant, we are given an instance of the k-median problem and a threshold value. Then this variant is the same as the k-median problem except that if the distance between a client i and a facility j is more than the threshold value, then i is not allowed to be connected to j. In this paper, we consider a matroid generalization

更新日期：2020-02-13
• Algorithmica (IF 0.882) Pub Date : 2020-02-10
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh

An input to a conflict-free variant of a classical problem $$\Gamma$$, called Conflict-Free$$\Gamma$$, consists of an instance I of $$\Gamma$$ coupled with a graph H, called the conflict graph. A solution to Conflict-Free$$\Gamma$$ in (I, H) is a solution to I in $$\Gamma$$, which is also an independent set in H. In this paper, we study conflict-free variants of Maximum Matching and Shortest Path

更新日期：2020-02-10
• Algorithmica (IF 0.882) Pub Date : 2020-02-05
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos

Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the StrongF-closure problem, where F is a fixed graph. This is a generalization of Strong Triadic Closure, whereas it is a relaxation of F-free Edge Deletion. In StrongF-closure, we want to select a maximum number

更新日期：2020-02-05
• Algorithmica (IF 0.882) Pub Date : 2020-02-03
Andreas Emil Feldmann, Dániel Marx

In this paper we study the hardness of the $$k$$-Center problem on inputs that model transportation networks. For the problem, a graph $$G=(V,E)$$ with edge lengths and an integer k are given and a center set $$C\subseteq V$$ needs to be chosen such that $$|C|\le k$$. The aim is to minimize the maximum distance of any vertex in the graph to the closest center. This problem arises in many applications

更新日期：2020-02-03
• Algorithmica (IF 0.882) Pub Date : 2020-02-01
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg

A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road section. In this paper, we consider the computational cartographic problem to place non-overlapping road labels along the edges so that as many road sections as possible are identified by their name, i.e., covered by a label. We show that this is NP-hard

更新日期：2020-02-01
• Algorithmica (IF 0.882) Pub Date : 2020-02-01
Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos

A subgraph complement of the graph G is a graph obtained from G by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph G and graph class $${\mathscr {G}}$$, is there a subgraph complement of G which is in $${\mathscr {G}}$$? We show that this problem can be solved in polynomial time for various choices of the graphs class $${\mathscr 更新日期：2020-02-01 • Algorithmica (IF 0.882) Pub Date : 2020-01-27 Keshav Goyal, Tobias Mömke In reoptimization, one is given an optimal solution to a problem instance and a (locally) modified instance. The goal is to obtain a solution for the modified instance. We aim to use information obtained from the given solution in order to obtain a better solution for the new instance than we are able to compute from scratch. In this paper, we consider Steiner tree reoptimization and address the optimality 更新日期：2020-01-27 • Algorithmica (IF 0.882) Pub Date : 2020-01-25 Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora A graph is d-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most d. d-orientability is a well-studied concept with close connections to fundamental graph-theoretic notions and applications as a load balancing problem. In this paper we consider the \(d$$-Orientable Deletion problem: given a graph $$G=(V,E)$$, delete the minimum number of vertices

更新日期：2020-01-25
• Algorithmica (IF 0.882) Pub Date : 2020-01-25
Tereza Klimošová, Josef Malík, Tomáš Masařík, Jana Novotná, Daniël Paulusma, Veronika Slívová

The k-Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours for a fixed integer k such that no two adjacent vertices are coloured alike. If each vertex u must be assigned a colour from a prescribed list $$L(u)\subseteq \{1,\ldots ,k\},$$ then we obtain the List k-Colouring problem. A graph G is H-free if G does not contain H as an induced subgraph. We continue

更新日期：2020-01-25
• Algorithmica (IF 0.882) Pub Date : 2020-01-22

Anomaly detection problems (also called change-point detection problems) have been studied in data mining, statistics and computer science over the last several decades (mostly in non-network context) in applications such as medical condition monitoring, weather change detection and speech recognition. In recent days, however, anomaly detection problems have become increasing more relevant in the context

更新日期：2020-01-22
• Algorithmica (IF 0.882) Pub Date : 2020-01-20
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid

We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $$G=(V,E)$$, find a shortest walk (“route”) from a source $${s\in V}$$ to a destination $$t\in V$$ that includes all vertices specified by a set $$WP \subseteq V$$: the waypoints. This Waypoint Routing Problem finds immediate applications in the context of modern networked systems. Our main contribution is an exact

更新日期：2020-01-20
• Algorithmica (IF 0.882) Pub Date : 2020-01-20
John Hershberger, Neeraj Kumar, Subhash Suri

We study the problem of finding shortest paths in the plane among h convex obstacles, where the path is allowed to pass through (violate) up to k obstacles, for $$k \le h$$. Equivalently, the problem is to find shortest paths that become obstacle-free if k obstacles are removed from the input. Given a fixed source point s, we show how to construct a map, called a shortest k-path map, so that all destinations

更新日期：2020-01-20
• Algorithmica Pub Date : 2019-03-16
Eleftherios Anastasiadis,Xiaotie Deng,Piotr Krysta,Minming Li,Han Qiao,Jinshan Zhang

The problem of pollution control has been mainly studied in the environmental economics literature where the methodology of game theory is applied for the pollution control. To the best of our knowledge this is the first time this problem is studied from the computational point of view. We introduce a new network model for pollution control and present two applications of this model. On a high level

更新日期：2019-11-01
• Algorithmica Pub Date : 2018-06-26
Bernhard Bliem,Stefan Woltran

A secure set S in a graph is defined as a set of vertices such that for any X⊆S the majority of vertices in the neighborhood of X belongs to S. It is known that deciding whether a set S is secure in a graph is co-NP -complete. However, it is still open how this result contributes to the actual complexity of deciding whether for a given graph G and integer k, a non-empty secure set for G of size at

更新日期：2019-11-01
• Algorithmica Pub Date : 2018-01-01
Pietro S Oliveto,Tiago Paixão,Jorge Pérez Heredia,Dirk Sudholt,Barbora Trubenová

Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function

更新日期：2019-11-01
• Algorithmica Pub Date : 2018-01-01
Leo van Iersel,Steven Kelk,Georgios Stamoulis,Leen Stougie,Olivier Boes

The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegree two is minimized. However, from a biological point of view accurately inferring the root location in a phylogenetic tree is notoriously difficult and poor root placement can artificially inflate the hybridization number

更新日期：2019-11-01
• Algorithmica Pub Date : 2017-07-12
Duc-Cuong Dang,Thomas Jansen,Per Kristian Lehre

Real-world optimisation problems are often dynamic. Previously good solutions must be updated or replaced due to changes in objectives and constraints. It is often claimed that evolutionary algorithms are particularly suitable for dynamic optimisation because a large population can contain different solutions that may be useful in the future. However, rigorous theoretical demonstrations for how populations

更新日期：2019-11-01
• Algorithmica Pub Date : 2014-02-20
Michael T Goodrich

We study sorting algorithms based on randomized round-robin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where comparisons are restricted to a distance bounded by a temperature parameter. Both algorithms are simple, randomized, data-oblivious sorting algorithms, which are useful in privacy-preserving computations, but, as we show

更新日期：2019-11-01
• Algorithmica Pub Date : 2014-01-15
Marek Cygan,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Ildikó Schlotter

We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc. The collection of results shows an interesting

更新日期：2019-11-01
• Algorithmica Pub Date : null
Nikhil Bansal,Parinya Chalermsook,Bundit Laekhanukit,Danupon Nanongkai,Jesper Nederlof

In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and an integer r > 1 , and the goal is to design an approximation algorithm with the fastest possible running time. We give randomized algorithms that establish an approximation ratio ofr for maximum independent set in O ∗ ( exp ( O ~ ( n / r log 2 r + r log 2 r )

更新日期：2019-11-01
• Algorithmica Pub Date : null
Zengfeng Huang,Pan Peng

In this paper we study graph problems in the dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require Ω ( n ) space, where n is the number of vertices, existing works mainly focused on designing O ( n · poly log n ) space algorithms. Although sublinear in the number of edges for dense graphs, it could still be too large for

更新日期：2019-11-01
• Algorithmica Pub Date : null
Clément Carbonnel,David A Cohen,Martin C Cooper,Stanislav Živný

Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints. We identify five new patterns whose absence ensures

更新日期：2019-11-01
• Algorithmica Pub Date : null
E Eiben,R Ganian,K Kangas,S Ordyniak

We consider the # P -complete problem of counting the number of linear extensions of a poset ( # LE ) ; a fundamental problem in order theory with applications in a variety of distinct areas. In particular, we study the complexity of # LE parameterized by the well-known decompositional parameter treewidth for two natural graphical representations of the input poset, i.e., the cover and the incomparability

更新日期：2019-11-01
• Algorithmica Pub Date : null
Martijn van Ee,René Sitters

The field of a priori optimization is an interesting subfield of stochastic combinatorial optimization that is well suited for routing problems. In this setting, there is a probability distribution over active sets, vertices that have to be visited. For a fixed tour, the solution on an active set is obtained by restricting the solution on the active set. In the well-studied a priori traveling salesman

更新日期：2019-11-01
• Algorithmica Pub Date : null
Andrei Lissovoi,Carsten Witt

Island models denote a distributed system of evolutionary algorithms which operate independently, but occasionally share their solutions with each other along the so-called migration topology. We investigate the impact of the migration topology by introducing a simplified island model with behavior similar to λ islands optimizing the so-called Maze fitness function (Kötzing and Molter in Proceedings

更新日期：2019-11-01
• Algorithmica Pub Date : null
Mark de Berg,Joachim Gudmundsson,Ali D Mehrabi

We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-aligned query range Q . We present data structures of size O ( n · polylog n ) and with query time O ( ( k + 1 ) · polylog n ) time, where k is the number of reported pairs, for two classes of objects in R 2 : axis-aligned

更新日期：2019-11-01
• Algorithmica Pub Date : null
Michał Włodarczyk

We introduce the non-commutative subset convolution-a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of quaternions used mainly in the quantum field theory. We apply this tool to speed up algorithms counting subgraphs parameterized by the treewidth of a graph. We present an

更新日期：2019-11-01
• Algorithmica Pub Date : null
Evangelos Bampas,Jurek Czyzowicz,Leszek Gąsieniec,David Ilcinkas,Ralf Klasing,Tomasz Kociumaka,Dominik Pająk

Two mobile robots are initially placed at the same point on an infinite line. Each robot may move on the line in either direction not exceeding its maximal speed. The robots need to find a stationary target placed at an unknown location on the line. The search is completed when both robots arrive at the target point. The target is discovered at the moment when either robot arrives at its position.

更新日期：2019-11-01
• Algorithmica Pub Date : null
Arne Meier,Sebastian Ordyniak,M S Ramanujan,Irena Schindler

In the present paper, we introduce the backdoor set approach into the field of temporal logic for the global fragment of linear temporal logic. We study the parameterized complexity of the satisfiability problem parameterized by the size of the backdoor. We distinguish between backdoor detection and evaluation of backdoors into the fragments of Horn and Krom formulas. Here we classify the operator

更新日期：2019-11-01
Contents have been reproduced by permission of the publishers.

down
wechat
bug