The survey is a comprehensive overview of the develo** area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

A circular economy approach requires methods of resource management that are
sustainable and efficient. A crucial process in waste management is collection and …

The number of arc routing publications has increased significantly in the last decade. Such
an increase justifies a second annotated bibliography, a sequel to Corberán and Prins …

One of the most fundamental results in combinatorial optimization is the polynomial-time 3/2-
approximation algorithm for the metric traveling salesman problem. It was presented by …

2.1▪ Introduction This chapter is devoted to surveying aspects of computational complexity
for three central arc routing problems (and their corresponding variants): CHINESE …

We prove that any polynomial‐time‐approximation algorithm for the n‐vertex metric
asymmetric Traveling Salesperson Problem yields a polynomial‐time‐approximation …

Abstract In the Directed Rural Postman Problem (DRPP), given a strongly connected
directed multigraph D=(V, A) with nonnegative integral weights on the arcs, a subset R of …

The aim of directed Eulerian extension problems is to make a given directed, possibly arc-
weighted,(multi-) graph Eulerian by adding a minimum-cost set of arcs. These problems …

We provide a new characterization of the NP-hard arc routing problem Rural Postman in
terms of a constrained variant of minimum-weight perfect matching on bipartite graphs. To …

Given a graph G=(V, E), two vertices s, t∈ V, and two integers k, ℓ, the Short Secluded Path
problem is to find a simple s‐t‐path with at most k vertices and ℓ neighbors. We study the …