A note on approximation algorithms for graph partitioning problems

Schrader, Rainer (1982) A note on approximation algorithms for graph partitioning problems.
Published in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) Vol. 62 (8). pp. 384-386.


Actions:
Full text not available from this repository.
Export as:
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: No citation data.
Uncontrolled Keywords:
Subjects:
  • 05-XX Combinatorics > 05Cxx Graph theory > 05C99 None of the above, but in this section

  • 68-XX Computer science > 68Rxx Discrete mathematics in relation to computer science > 68R10 Graph theory

  • 94-XX Information and communication, circuits > 94Cxx Circuits, networks > 94C15 Applications of graph theory

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
    Related URLs:
    Deposit Information:
    ZAIK Number: UNSPECIFIED
    Depositing User: Archive Admin
    Date Deposited: 30 Jun 2014 12:36
    Last Modified: 30 Jun 2014 12:36
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/719