JDA

2008

13 years 9 months ago
2008

Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...

JDA

2006

13 years 9 months ago
2006

Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...

JDA

2006

13 years 9 months ago
2006

The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of

JDA

2006

13 years 9 months ago
2006

In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...

JDA

2006

13 years 9 months ago
2006

JDA

2006

13 years 9 months ago
2006

We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)

JDA

2006

13 years 9 months ago
2006

JDA

2006

13 years 9 months ago
2006

This paper studies a resource allocation problem introduced by Koutsoupias and Papadimitriou. The scenario is modelled as a multiple-player game in which each player selects one o...

JDA

2006

13 years 9 months ago
2006

We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...

JDA

2006

13 years 9 months ago
2006

We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...