Goldschmidt Olivier

Olivier Goldschmidt

Information about the author Olivier Goldschmidt will soon be added to the site.
Found 5 papers in total
A new and improved algorithm for the 3-cut problem
A new and improved algorithm for the 3-cut problem
1997
We present a O( mn 3 ) time exact algorithm for finding a minimum 3-cut in an...
On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
1996
The BSPS problem is to find a planar and biconnected spanning subgraph of a general...
On locally optimal independent sets and vertex covers
On locally optimal independent sets and vertex covers
1996
In this paper, the authors introudce a new notion of local optimality and demonstrate...
Note: On the set-union knapsack problem
Note: On the set-union knapsack problem
1994
The authors consider a generalization of the 0-1 knapsack problem called the set-union...
A polynomial algorithm for the k-cut problem for fixed k
A polynomial algorithm for the k-cut problem for fixed k
1994
The k -cut problem is to find a partition of an edge weighted graph into k nonempty...
Papers per page: