001 | 977832 | ||
005 | 20250905132300.0 | ||
024 | 7 | _ | |2 ISSN |a 0028-3045 |
024 | 7 | _ | |2 ISSN |a 1097-0037 |
024 | 7 | _ | |2 SCOPUS |a SCOPUS:2-s2.0-85181957124 |
024 | 7 | _ | |2 WOS |a WOS:001139928300001 |
024 | 7 | _ | |2 datacite_doi |a 10.18154/RWTH-2024-00934 |
024 | 7 | _ | |2 doi |a 10.1002/net.22204 |
037 | _ | _ | |a RWTH-2024-00934 |
041 | _ | _ | |a English |
082 | _ | _ | |a 620 |
100 | 1 | _ | |0 P:(DE-82)IDM06483 |a Mathwieser, Corinna Marlene |b 0 |e Corresponding author |u rwth |
245 | _ | _ | |a Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty |h online |
260 | _ | _ | |a New York, NY |b Wiley |c 2024 |
336 | 7 | _ | |0 0 |2 EndNote |a Journal Article |
336 | 7 | _ | |0 PUB:(DE-HGF)16 |2 PUB:(DE-HGF) |a Journal Article |b journal |m journal |
336 | 7 | _ | |2 BibTeX |a ARTICLE |
336 | 7 | _ | |2 DRIVER |a article |
336 | 7 | _ | |2 DataCite |a Output Types/Journal article |
336 | 7 | _ | |2 ORCID |a JOURNAL_ARTICLE |
536 | _ | _ | |0 G:(DE-82)X021000-OA |a OA - Open Access Publikation mit Unterstützung der Universitätsbibliothek der RWTH Aachen University (X021000-OA) |c X021000-OA |x 0 |
588 | _ | _ | |a Dataset connected to , , |
591 | _ | _ | |a Austria |
591 | _ | _ | |a Germany |
700 | 1 | _ | |0 0000-0002-5099-8804 |a Çela, Eranda |b 1 |
773 | _ | _ | |0 PERI:(DE-600)1481067-0 |a 10.1002/net.22204 |n 3 |p 587-604 |t Networks : an international journal |v 83 |x 1097-0037 |y 2024 |
856 | 4 | _ | |u https://publications.rwth-aachen.de/record/977832/files/977832.pdf |y OpenAccess |
876 | 7 | _ | |c 1837.20 |d 2024-06-24 |e Hybrid-OA |j DEAL |l Wiley |v 241.04 |x 021000-125620 |
909 | C | O | |o oai:publications.rwth-aachen.de:977832 |p openaire |p open_access |p OpenAPC_DEAL |p driver |p VDB |p openCost |p dnbdelivery |
910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM06483 |a RWTH Aachen |b 0 |k RWTH |
914 | 1 | _ | |y 2024 |
915 | 1 | _ | |0 StatID:(DE-HGF)0031 |2 StatID |a Peer reviewed article |x 0 |
915 | _ | _ | |0 LIC:(DE-HGF)CCBY4 |2 HGFVOC |a Creative Commons Attribution CC BY 4.0 |
915 | _ | _ | |0 StatID:(DE-HGF)0100 |2 StatID |a JCR |b NETWORKS : 2022 |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)0113 |2 StatID |a WoS |b Science Citation Index Expanded |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)0150 |2 StatID |a DBCoverage |b Web of Science Core Collection |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)0160 |2 StatID |a DBCoverage |b Essential Science Indicators |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)0199 |2 StatID |a DBCoverage |b Clarivate Analytics Master Journal List |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)0200 |2 StatID |a DBCoverage |b SCOPUS |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)0300 |2 StatID |a DBCoverage |b Medline |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)0420 |2 StatID |a Nationallizenz |d 2023-08-26 |w ger |
915 | _ | _ | |0 StatID:(DE-HGF)0510 |2 StatID |a OpenAccess |
915 | _ | _ | |0 StatID:(DE-HGF)1160 |2 StatID |a DBCoverage |b Current Contents - Engineering, Computing and Technology |d 2023-08-26 |
915 | _ | _ | |0 StatID:(DE-HGF)3001 |2 StatID |a DEAL Wiley |d 2023-08-26 |w ger |
915 | _ | _ | |0 StatID:(DE-HGF)9900 |2 StatID |a IF < 5 |d 2023-08-26 |
915 | p | c | |0 PC:(DE-HGF)0000 |2 APC |a APC keys set |
915 | p | c | |0 PC:(DE-HGF)0120 |2 APC |a DEAL: Wiley 2019 |
915 | p | c | |0 PC:(DE-HGF)0002 |2 APC |a DFG OA Publikationskosten |
920 | 1 | _ | |0 I:(DE-82)125620_20210528 |k 125620 |l Lehr- und Forschungsgebiet Kombinatorische Optimierung |x 0 |
920 | 1 | _ | |0 I:(DE-82)120000_20140620 |k 120000 |l Fachgruppe Informatik |x 1 |
980 | 1 | _ | |a FullTexts |
980 | _ | _ | |a I:(DE-82)120000_20140620 |
980 | _ | _ | |a I:(DE-82)125620_20210528 |
980 | _ | _ | |a UNRESTRICTED |
980 | _ | _ | |a VDB |
980 | _ | _ | |a journal |
980 | _ | _ | |a APC |
Library | Collection | CLSMajor | CLSMinor | Language | Author |
---|