Sciweavers

1215 search results - page 159 / 243
» Combinatorics
Sort
View
COCOON
2006
Springer
15 years 10 months ago
Restricted Mesh Simplification Using Edge Contractions
We consider the problem of simplifying a triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contr...
Mattias Andersson, Joachim Gudmundsson, Christos L...
170
Voted
COCOON
2006
Springer
15 years 10 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
143
Voted
COCOON
2006
Springer
15 years 10 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...
170
Voted
COCOON
2006
Springer
15 years 10 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
172
Voted
COCOON
2006
Springer
15 years 10 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