Searching for authors named "Thomas Hofmeister" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Approximating Maximum Independent Sets in Uniform Hypergraphs
- …We consider the problem of approximating the independence number and the chromatic number of k-uniform hypergraphs on n vertices. For fixed integers k 2, we obtain for both problems that one can achieve in polynomial time approximation ratios of at most O(n=(log (k\Gamma1) n) 2 ). This exte…
- Cited by 12 (0 self) – Add To MetaCart
-
A Comparison of Approximation Algorithms for the MaxCut-Problem
- …In this paper we compare, from a practical point of view, approximation algorithms for the problem MaxCut. For this problem, we are given an undirected graph G = (V, E) with vertex set V and edge set E, and we are looking for a partition V = V1 [ V2 with V1 \ V2 = � of the vertex set which maximize…
- Cited by 3 (0 self) – Add To MetaCart
-
An algorithm for Heilbronn's problem
- …Abstract Heilbronn conjectured that given arbitrary n points from R 2,located in the unit square (or circle), there must be three points which form a triangle of area at most O(1=n 2). This conjecture was proved false by a nonconstructive argument of Komlos, Pintz and Szemeredi [KPS] who showed that…
- Cited by 5 (0 self) – Add To MetaCart
-
Sparse 0-1-Matrices and Forbidden Hypergraphs
- …We consider the problem of determining the maximal number N (m; k; r) of columns of a 01 -matrix with m rows and exactly r ones in each column such that every k columns are linearly independent over Z 2 . For fixed integers k 4 and r 2 where k is even and gcd(k\Gamma1; r) = 1, we shall prove the p…
- Cited by 1 (0 self) – Add To MetaCart
-
A Geometric Framework for Solving Subsequence Problems in Computational Biology Efficiently
- …In this paper, we introduce the notion of a constrained Minkowski sum which for two (finite) point-sets P,Q ⊆ R 2 and a set of k inequalities Ax � b is defined as the pointset (P ⊕ Q)Ax�b = {x = p+ q | p ∈ P, q ∈ Q, Ax � b}. We show that typical subsequence problems from computational biology can be…
- Cited by 1 (0 self) – Add To MetaCart
-
A probabilistic 3{SAT algorithm further improved
- …In [Sch99], Schoning proposed a simple yet ecient randomized algorithm for solving the k- SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) (4=3) O(1:3334 ) when given a formula F on n variables. This was the up to now best running time known for an alg…
- Add To MetaCart
-
26. Workshop uber Komplexitätstheorie, Datenstrukturen und effiziente Algorithmen, TU-Berlin
- …L
6= 1UL 18.05 Ende Universal hashing and k-wise independent random variables via integer arithmetic without primes Martin Dietzfelbinger Fachbereich Informatik, Universitat Dortmund, Germany email: dietzf@ls2.informatik.uni-dortmund.de Let u; m 1 be arbitrary integers and let r um be a… - Add To MetaCart
Showing 1 through 7.
