Advertisement

Complexity Theory and Algorithms

  • Friedhelm Mayer auf der Heide
  • Mirosław Kutyłowski
  • Prabhakar Ragde
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1900)

Abstract

This workshop embraces algorithmic and complexity theory issues in parallel computing. A total of 10 submissions were received. Three papers were accepted, two as regular papers, one as a research note.

Keywords

Short Path Parallel Computing Linear Programming Problem Complexity Theory Combinatorial Optimization Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Friedhelm Mayer auf der Heide
  • Mirosław Kutyłowski
  • Prabhakar Ragde

There are no affiliations available

Personalised recommendations