Sciweavers

COCOON
2006
Springer
13 years 8 months ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
Min Chih Lin, Jayme Luiz Szwarcfiter
COCOON
2006
Springer
13 years 8 months ago
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...
George Karakostas, Stavros G. Kolliopoulos
COCOON
2006
Springer
13 years 8 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
COCOON
2006
Springer
13 years 8 months ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
COCOON
2006
Springer
13 years 8 months ago
Overlap-Free Regular Languages
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
Yo-Sub Han, Derick Wood
COCOON
2006
Springer
13 years 8 months ago
Varieties Generated by Certain Models of Reversible Finite Automata
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
Marats Golovkins, Jean-Eric Pin
COCOON
2006
Springer
13 years 8 months ago
On Indecomposability Preserving Elimination Sequences
Chandan K. Dubey, Shashank K. Mehta
COCOON
2006
Springer
13 years 8 months ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang
COCOON
2006
Springer
13 years 8 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
COCOON
2006
Springer
13 years 8 months ago
Computing Maximum-Scoring Segments in Almost Linear Time
Fredrik Bengtsson, Jingsen Chen