Sciweavers

JDA
2008
122views more  JDA 2008»
13 years 9 months ago
An approximation algorithm for sorting by reversals and transpositions
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 ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
JDA
2006
83views more  JDA 2006»
13 years 9 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
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...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
JDA
2006
59views more  JDA 2006»
13 years 9 months ago
A note on the complexity of minimum dominating set
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
Fabrizio Grandoni
JDA
2006
184views more  JDA 2006»
13 years 9 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
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...
Camil Demetrescu, Giuseppe F. Italiano
JDA
2006
89views more  JDA 2006»
13 years 9 months ago
Area-preserving approximations of polygonal paths
Prosenjit Bose, Sergio Cabello, Otfried Cheong, Jo...
JDA
2006
90views more  JDA 2006»
13 years 9 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall
JDA
2006
80views more  JDA 2006»
13 years 9 months ago
Utilitarian resource assignment
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...
Petra Berenbrink, Leslie Ann Goldberg, Paul W. Gol...
JDA
2006
87views more  JDA 2006»
13 years 9 months ago
A 3-approximation for the pathwidth of Halin graphs
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...
Fedor V. Fomin, Dimitrios M. Thilikos
JDA
2006
106views more  JDA 2006»
13 years 9 months ago
An optimal algorithm to generate tilings
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...
Sébastien Desreux, Eric Rémila