Jungnickel Dieter

Dieter Jungnickel

Information about the author Dieter Jungnickel will soon be added to the site.
Found 11 papers in total
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
2000
The well-studied 0/1 Knapsack and Subset-Sum problem are maximization problems that...
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O(√(n)mlog(n2/m)/log n) bound for the nonbipartite cardinality matching problem
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O(√(n)mlog(n2/m)/log n) bound for the nonbipartite cardinality matching problem
2003
This paper closes some gaps in the discussion of nonweighted balanced network flow...
Balanced network flows. VII. Primal–dual algorithms
Balanced network flows. VII. Primal–dual algorithms
2002
We discuss an adaptation of the famous primal–dual 1-matching algorithm to...
Balanced network flows. IV. Duality and structure theory
Balanced network flows. IV. Duality and structure theory
2001
In this paper, we present a theory for generalized graph factor problems which is...
Balanced network flows. V. Cycle-canceling algorithms
Balanced network flows. V. Cycle-canceling algorithms
2001
We discuss Anstee's approach for solving generalized matching problems by solving an...
Balanced network flows. VI. Polyhedral descriptions
Balanced network flows. VI. Polyhedral descriptions
2001
This paper discusses the balanced circulation polytope, that is, the convex hull of...
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
1999
We discuss a wide range of matching problems in terms of a network flow model. More...
Balanced network flows. II. Simple augmentation algorithms
Balanced network flows. II. Simple augmentation algorithms
1999
In previous papers, we discussed the fundamental theory of matching problems and...
Balanced network flows. III. Strongly polynomial augmentation algorithms
Balanced network flows. III. Strongly polynomial augmentation algorithms
1999
We discuss efficient augmentation algorithms for the maximum balanced flow problem...
Efficient algorithms for the clearing of interbank payments
Efficient algorithms for the clearing of interbank payments
1998
The clearing of interbank payments is a process which usually involves an immense...
Trace-orthogonal normal bases
Trace-orthogonal normal bases
1993
This paper first obtains some basic theoretical results on trace-orthogonal normal...
Papers per page: