#### Filter Results:

- Full text PDF available (46)

#### Publication Year

1985

2015

- This year (0)
- Last five years (9)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Wolfgang W. Bein, Peter Brucker, Arie Tamir
- Discrete Applied Mathematics
- 1985

It is shown that an acyclic multigraph with a single source and a single sink is series-parallel if and only if for arbitrary linear cost functions and arbitrary capacities the corresponding minimum cost flow problem can be solved by a greedy algorithm. Furthermore, for networks of this type with m edges and n vertices, two O(mn + m log m)-algorithms are… (More)

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. This paper gives an O(n2"5) algorithm for minimizing node reductions, based on vertex… (More)

- Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak
- Discrete Applied Mathematics
- 1995

- Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. Stallmann
- SIAM J. Comput.
- 1992

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. We give an O(n 2:5) algorithm for minimizing node reductions, based on vertex cover in a… (More)

- Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman
- Math. Program.
- 1993

- Wolfgang W. Bein, Lawrence L. Larmore
- Inf. Process. Lett.
- 2000

A class of " simple " online algorithms for the k-server problem is identified. This class, for which the term trackless is introduced, includes many known server algorithms. The k-server conjecture fails for trackless algorithms. A lower bound of 23/11 on the competitiveness of any deterministic trackless 2-server algorithm and a lower bound of 1 + √ 2/2… (More)

- Wolfgang W. Bein, José R. Correa, Xin Han
- Theor. Comput. Sci.
- 2007

" Bin packing with rejection " is the following problem: Given a list of items with associated sizes and rejection costs, find a packing into unit bins of a subset of the list such that the number of bins used plus the sum of rejection costs of unpacked items is minimized. We show that bin packing with rejection can be reduced to n multiple knapsack… (More)

- Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
- Inf. Process. Lett.
- 2000

An efficient randomized online algorithm for the paging problem for cache size 2 is given, which is 3 2-competitive against an oblivious adversary. The algorithm keeps track of at most one page in slow memory at any time. A lower bound of 37 24 ≈ 1.5416 is given for the competitiveness of any trackless online algorithm for the same problem, i.e., an… (More)

- Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
- Int. J. Found. Comput. Sci.
- 2002