h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

Approximately covering by cycles in planar graphs

;

In
Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms : [Washington, DC) : January 07-09, 2001] / [sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics], Seiten/Artikel-Nr: 402-406

Konferenz/Event:12. Annual ACM-SIAM Symposium on Discrete Algorithms , Washington, DC , USA , 2001-01-07 - 2001-01-09

ImpressumNew York, NY : Association for Computing Machinery [u.a.]

Umfang402-406

ISBN0-89871-490-7

ReiheAnnual ACM-SIAM Symposium on Discrete Algorithms ; 12

Einrichtungen

  1. Fachgruppe Mathematik (110000)
  2. Lehrstuhl II für Mathematik (für Ingenieure) (113210)



Dokumenttyp
Contribution to a conference proceedings/Contribution to a book

Format
print

Sprache
English

Anmerkung
Peer reviewed article

Interne Identnummern
RWTH-CONV-181188
Datensatz-ID: 109055

 GO

QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Faculty of Mathematics and Natural Sciences (Fac.1) > Department of Mathematics
Public records
Publications database
113210
110000
 Record created 2013-01-28, last modified 2023-03-06
Similar records



Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)