Searching for authors named "Klaus Jansen" – sorted by Relevance.
-
Approximation algorithms for fractional covering and packing problems, and applications
- Approximation Algorithms for Fractional Covering and Packing Problems, and Applications Klaus
- Cited by 2 (1 self) – Add To MetaCart
-
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling
- scheduling Klaus Jansen y Institut fur Informatik und praktische Mathematik, Universitat zu Kiel
- Cited by 3 (0 self) – Add To MetaCart
-
Approximation algorithms for mixed fractional packing and covering problems
- APPROXIMATION ALGORITHMS FOR MIXED FRACTIONAL PACKING AND COVERING PROBLEMS£ Klaus Jansen
- Cited by 6 (1 self) – Add To MetaCart
-
Approximation Algorithms for Time Constrained Scheduling
- Approximation Algorithms for Time Constrained Scheduling Klaus Jansen 1 , Sabine Ohring 2 1
- Cited by 9 (1 self) – Add To MetaCart
-
Scheduling With Constrained Processor Allocation for Interval Orders
- Scheduling with constrained processor allocation for interval orders Klaus Jansen Scope
- Cited by 3 (1 self) – Add To MetaCart
-
One Strike Against the Min-Max Degree Triangulation Problem
- One strike against the min-max degree triangulation problem Klaus Jansen Fachbereich IV
- Cited by 5 (0 self) – Add To MetaCart
-
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
- Klaus Jansen y Institut fur Informatik und praktische Mathematik Christian-Albrechts-Universitat zu
- Cited by 7 (2 self) – Add To MetaCart
-
Approximation Results for the Optimum Cost Chromatic Partition Problem
- for the Optimum Cost Chromatic Partition Problem Klaus Jansen Abstract. In this paper, we study the optimum cost
- Cited by 15 (0 self) – Add To MetaCart
-
A Characterization for Parity Graphs and a Coloring Problem With Costs
- A characterization for parity graphs and a coloring problem with costs Klaus Jansen Max
- Add To MetaCart
-
Algorithms Based on Randomization and Linear and Semidefinite Programming
- Algorithms Based on Randomization and Linear and Semidenite Programming Klaus Jansen 1 , Jose
- Add To MetaCart

