( en | de | ru )

 

Disambiguation of "Schuurman, Petra"

Author of the publication

copydeleteadd this publication to your clipboard
Non-approximability Results for Scheduling Problems with Minsum Criteria.

, , and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 353-366. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Heinrich Petram

Matthias Petran

Oskar Peter Petrasch

Rainer Petrasch

Pantelis Petrakakis

 

Other publications of authors with the same name

Performance Guarantees of Local Search for Multiprocessor Scheduling., and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 370-382. Springer, (2001)Scheduling a pipelined operator graph., and . SODA, page 207-212. ACM/SIAM, (2000)Performance guarantees of jump neighborhoods on restricted related parallel machines., , , and . Oper. Res. Lett., 40 (4): 287-291 (2012)Preemptive Scheduling with Job-Dependent Setup Times., and . SODA, page 759-767. ACM/SIAM, (1999)De Bruijn Graphs and DNA Graphs., , and . WG, volume 2204 of Lecture Notes in Computer Science, page 296-305. Springer, (2001)Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling., , , and . LATIN, volume 6034 of Lecture Notes in Computer Science, page 108-119. Springer, (2010)Non-approximability Results for Scheduling Problems with Minsum Criteria., , and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 353-366. Springer, (1998)Recognizing DNA graphs is difficult., , and . Discret. Appl. Math., 127 (1): 85-94 (2003)DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem., , , , and . WG, volume 2573 of Lecture Notes in Computer Science, page 13-24. Springer, (2002)A polynomial time equivalence between DNA sequencing and the exact perfect matching problem., , , , and . Discret. Optim., 4 (2): 154-162 (2007)