#### Filter Results:

- Full text PDF available (86)

#### Publication Year

2003

2017

- This year (4)
- Last 5 years (29)
- Last 10 years (63)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The <i>Steiner tree</i> problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem was improved from 2 to the current best 1.55 [Robins,Zelikovsky-SIDMA'05]. All these algorithms… (More)

- Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
- J. ACM
- 2009

For more than 40 years, Branch & Reduce exponential-time backtracking algorithms have been among the most common tools used for finding exact solutions of NP-hard problems. Despite that, the way to analyze such recursive algorithms is still far from producing tight worst-case running time bounds. Motivated by this, we use an approach, that we call… (More)

- Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
- ICALP
- 2006

We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number of memory faults. In particular, we design an O(n log n) time sorting algorithm that can optimally… (More)

Measuring the importance of a node in a network is a major goal in the analysis of social networks, biological systems, transportation networks etc. Different centrality measures have been proposed to capture the notion of node importance. For example, the center of a graph is a node that minimizes the maximum distance to any other node (the latter distance… (More)

- Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
- SODA
- 2006

For more than 30 years Davis-Putnam-style exponentialtime backtracking algorithms have been the most common tools used for finding exact solutions of NP-hard problems. Despite of that, the way to analyze such recursive algorithms is still far from producing tight worst case running time bounds. The “Measure and Conquer” approach is one of the recent… (More)

- Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
- ICALP
- 2005

Davis-Putnam-style exponential-time backtracking algorithms are the most common algorithms used for finding exact solutions of NP-hard problems. The analysis of such recursive algorithms is based on the bounded search tree technique: a measure of the size of the subproblems is defined; this measure is used to lower bound the progress made by the algorithm… (More)

- André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
- Math. Program.
- 2008

Many polynomial-time solvable combinatorial optimization problems become NP-hard if an additional complicating constraint is added to restrict the set of feasible solutions. In this paper, we consider two such problems, namely maximum-weight matching and maximumweight matroid intersection with one additional budget constraint. We present the first… (More)

- Friedrich Eisenbrand, Fabrizio Grandoni
- Theor. Comput. Sci.
- 2004

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection.

- Fabrizio Grandoni, Giuseppe F. Italiano
- ISAAC
- 2006

In the single-sink buy-at-bulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity: the ratio cost/capacity decreases from small to large… (More)

- Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
- ACM Trans. Algorithms
- 2008

We provide an algorithm listing all minimal dominating sets of a graph on <i>n</i> vertices in time <i>O</i>(1.7159<sup><i>n</i></sup>). This result can be seen as an algorithmic proof of the fact that the number of minimal dominating sets in a graph on <i>n</i> vertices is at most 1.7159<sup><i>n</i></sup>, thus improving on the trivial… (More)