h1

h2

h3

h4

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

Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty

;

In
Networks : an international journal 83(3), Seiten/Artikel-Nr.:587-604

ImpressumNew York, NY : Wiley

ISSN1097-0037

Online
DOI: 10.18154/RWTH-2024-00934
DOI: 10.1002/net.22204

URL: http://publications.rwth-aachen.de/record/977832/files/977832.pdf

Einrichtungen

  1. Lehr- und Forschungsgebiet Kombinatorische Optimierung (125620)
  2. Fachgruppe Informatik (120000)

Projekte

  1. OA - Open Access Publikation mit Unterstützung der Universitätsbibliothek der RWTH Aachen University (X021000-OA) (X021000-OA)

Thematische Einordnung (Klassifikation)
DDC: 620

OpenAccess:
Download fulltext PDF

Dokumenttyp
Journal Article

Format
online

Sprache
English

Anmerkung
Peer reviewed article

Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-85181957124
WOS Core Collection: WOS:001139928300001

Interne Identnummern
RWTH-2024-00934
Datensatz-ID: 977832

Beteiligte Länder
Austria, Germany

 GO

Medline ; Creative Commons Attribution CC BY 4.0 ; OpenAccess ; Clarivate Analytics Master Journal List ; Current Contents - Engineering, Computing and Technology ; DEAL Wiley ; Essential Science Indicators ; IF < 5 ; JCR ; NationallizenzNationallizenz ; SCOPUS ; Science Citation Index Expanded ; Web of Science Core Collection
QR Code for this record

The record appears in these collections:
Document types > Articles > Journal Articles
Faculty of Mathematics, Computer Science and Natural Sciences (Fac.1) > Department of Computer Science
Publication server / Open Access
Public records
Publication Charges
Publications database
120000
125620
 Record created 2024-01-29, last modified 2025-09-05
Similar records


OpenAccess:
Download fulltext PDF
Rate this document:

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