Cycles in graphs play an important role in many applications, eg, analysis of electrical
networks, analysis of chemical and biological pathways, periodic scheduling, and graph …

Preprocessing, or data reduction, is a standard technique for simplifying and speeding up
computation. Written by a team of experts in the field, this book introduces a rapidly …

The local ratio technique is a methodology for the design and analysis of algorithms for a
broad range of optimization problems. The technique is remarkably simple and elegant, and …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

We present a general framework for solving resource allocation and scheduling problems.
Given a resource of fixed size, we present algorithms that approximate the maximum …

The (parameterized) feedback vertex set problem on directed graphs, which we refer to as
the dfvs problem, is defined as follows: given a directed graph G and a parameter k, either …

We present a simple family of algorithms for solving the Generalized Assignment Problem
(GAP). Our technique is based on a novel combinatorial translation of any algorithm for the …

Let F be a finite set of graphs. In the F-DELETION problem, we are given an n-vertex graph
G and an integer k as input, and asked whether at most k vertices can be deleted from G …

We show that the NP-complete Feedback Vertex Set problem, which asks for the smallest
set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O …