Klaus Jansen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Lin Chen 0009

> Home > Persons > Klaus Jansen

Publications

2018
[j88]
- view
  authority control:
- export record
  dblp key:
  - journals/jcss/ChenJZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/ChenJZ18
Lin Chen, Klaus Jansen, Guochuan Zhang:
On the optimality of exact and approximation algorithms for scheduling problems. J. Comput. Syst. Sci. 96: 1-32 (2018)
2016
[c118]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoa/0011JLZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/0011JLZ16
Lin Chen, Klaus Jansen, Wenchang Luo, Guochuan Zhang:
An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. COCOA 2016: 608-623
2014
[c107]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/soda/ChenJZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChenJZ14
Lin Chen, Klaus Jansen, Guochuan Zhang:
On the optimality of approximation schemes for the classical scheduling problem. SODA 2014: 657-668
2013
[i24]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/ChenJZ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChenJZ13
Lin Chen, Klaus Jansen, Guochuan Zhang:
On the optimality of approximation schemes for the classical scheduling problem. CoRR abs/1310.0398 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.