Also published as report no. SFB-303--94827Available from TIB Hannover: RN 4052(94827) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
AbstractUsing ideas and results from polynomial time approximation and exact computation we design a...
Abstract. We introduce a new combinatorial optimization problem in this paper, called the Minimum Co...
Using ideas and results from polynomial time approximation and exact computation we design approxima...
In this paper we discuss strategies for constructing approximation algorithms for solving the Min-k-...
This talk was given to the University of Alberta Department of Computing Science
Given a graph G, the sparsest-cut problem asks to find the set of vertices S which has the least exp...
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the pro...
AbstractGiven matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider...
AbstractWe consider the following problem: Given a graph with edge lengths satisfying the triangle i...
A theory is presented for simultaneous Diophantine approximation by means of minimal sets of lattice...
AbstractSupposeKis the intersection of a finite number of closed half-spaces {Ki} in a Hilbert space...
We design polynomial time approximation schemes (PTASs) for Metric MINBISECTION, i.e. dividing a giv...
Abstract We present new combinatorial approximation algorithms for the k-set cover problem. Previous...
The hypercube segmentation problem is the following: Given a set S of m 4d vertices of the discrete ...
The paper presents distributed and parallel δ-approximation algorithms for covering problems, where ...
AbstractUsing ideas and results from polynomial time approximation and exact computation we design a...
Abstract. We introduce a new combinatorial optimization problem in this paper, called the Minimum Co...
Using ideas and results from polynomial time approximation and exact computation we design approxima...
In this paper we discuss strategies for constructing approximation algorithms for solving the Min-k-...
This talk was given to the University of Alberta Department of Computing Science
Given a graph G, the sparsest-cut problem asks to find the set of vertices S which has the least exp...
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the pro...
AbstractGiven matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider...
AbstractWe consider the following problem: Given a graph with edge lengths satisfying the triangle i...
A theory is presented for simultaneous Diophantine approximation by means of minimal sets of lattice...
AbstractSupposeKis the intersection of a finite number of closed half-spaces {Ki} in a Hilbert space...
We design polynomial time approximation schemes (PTASs) for Metric MINBISECTION, i.e. dividing a giv...
Abstract We present new combinatorial approximation algorithms for the k-set cover problem. Previous...
The hypercube segmentation problem is the following: Given a set S of m 4d vertices of the discrete ...
The paper presents distributed and parallel δ-approximation algorithms for covering problems, where ...
AbstractUsing ideas and results from polynomial time approximation and exact computation we design a...
Abstract. We introduce a new combinatorial optimization problem in this paper, called the Minimum Co...
Using ideas and results from polynomial time approximation and exact computation we design approxima...