Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …

For the vast majority of local problems on graphs of small tree width (where by local we
mean that a solution can be verified by checking separately the neighbourhood of each …

This paper surveys heuristic methods for matrix bandwidth reduction, including low-cost
methods and metaheuristics. This optimization min–max problem represents a demanding …

In this paper we study quantum algorithms for NP-complete problems whose best classical
algorithm is an exponential time application of dynamic programming. We introduce the path …

We revisit two well-studied problems, Bounded Degree Vertex Deletion and Defective
Coloring, where the input is a graph G and a target degree Δ, and we are asked either to edit …

The maximum Nash social welfare (NSW)---which maximizes the geometric mean of agents'
utilities---is a fundamental solution concept with remarkable fairness and efficiency …

Abstract In the Connected Vertex Cover problem we are given an undirected graph G
together with an integer k and we are to find a subset of vertices X of size at most k, such that …

Given an undirected graph with n vertices, the Maximum Leaf Spanning Tree problem is to
find a spanning tree with as many leaves as possible. When parameterized in the number of …

Fixed-parameter algorithms, approximation algorithms and moderately exponential
algorithms are three major approaches to algorithm design. While each of them being very …

Recursively scalable networks are a concept in computer science and networking where
networks are designed in a way that allows them to expand or scale-up seamlessly by …