Sciweavers

CORR
2010
Springer
94views Education» more  CORR 2010»
12 years 10 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
David R. Wood
CORR
2011
Springer
192views Education» more  CORR 2011»
12 years 10 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
TCBB
2010
137views more  TCBB 2010»
13 years 2 months ago
Alignments of RNA Structures
— We describe a theoretical unifying framework to express comparison of RNA structures, which we call alignment hierarchy. This framework relies on the definition of common supe...
Guillaume Blin, Alain Denise, Serge Dulucq, Claire...
SIGACT
2010
74views more  SIGACT 2010»
13 years 2 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
13 years 2 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li
MST
2007
121views more  MST 2007»
13 years 3 months ago
Chinese Remaindering with Multiplicative Noise
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...
Igor Shparlinski, Ron Steinfeld
JCSS
2002
95views more  JCSS 2002»
13 years 3 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
IPL
2000
95views more  IPL 2000»
13 years 3 months ago
An efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
Jean Marcel Pallo
ANOR
2002
88views more  ANOR 2002»
13 years 3 months ago
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
Horst W. Hamacher, Martine Labbé, Stefan Ni...
DAM
2008
108views more  DAM 2008»
13 years 3 months ago
Feedback vertex set on AT-free graphs
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
Dieter Kratsch, Haiko Müller, Ioan Todinca