h1

h2

h3

h4

h5
h6
000977832 001__ 977832
000977832 005__ 20250905132300.0
000977832 0247_ $$2ISSN$$a0028-3045
000977832 0247_ $$2ISSN$$a1097-0037
000977832 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-85181957124
000977832 0247_ $$2WOS$$aWOS:001139928300001
000977832 0247_ $$2datacite_doi$$a10.18154/RWTH-2024-00934
000977832 0247_ $$2doi$$a10.1002/net.22204
000977832 037__ $$aRWTH-2024-00934
000977832 041__ $$aEnglish
000977832 082__ $$a620
000977832 1001_ $$0P:(DE-82)IDM06483$$aMathwieser, Corinna Marlene$$b0$$eCorresponding author$$urwth
000977832 245__ $$aSpecial cases of the minimum spanning tree problem under explorable edge and vertex uncertainty$$honline
000977832 260__ $$aNew York, NY$$bWiley$$c2024
000977832 3367_ $$00$$2EndNote$$aJournal Article
000977832 3367_ $$0PUB:(DE-HGF)16$$2PUB:(DE-HGF)$$aJournal Article$$bjournal$$mjournal
000977832 3367_ $$2BibTeX$$aARTICLE
000977832 3367_ $$2DRIVER$$aarticle
000977832 3367_ $$2DataCite$$aOutput Types/Journal article
000977832 3367_ $$2ORCID$$aJOURNAL_ARTICLE
000977832 536__ $$0G:(DE-82)X021000-OA$$aOA - Open Access Publikation mit Unterstützung der Universitätsbibliothek der RWTH Aachen University (X021000-OA)$$cX021000-OA$$x0
000977832 588__ $$aDataset connected to , ,
000977832 591__ $$aAustria
000977832 591__ $$aGermany
000977832 7001_ $$00000-0002-5099-8804$$aÇela, Eranda$$b1
000977832 773__ $$0PERI:(DE-600)1481067-0$$a10.1002/net.22204$$n3$$p587-604$$tNetworks : an international journal$$v83$$x1097-0037$$y2024
000977832 8564_ $$uhttps://publications.rwth-aachen.de/record/977832/files/977832.pdf$$yOpenAccess
000977832 8767_ $$c1837.20$$d2024-06-24$$eHybrid-OA$$jDEAL$$lWiley$$v241.04$$x021000-125620
000977832 909CO $$ooai:publications.rwth-aachen.de:977832$$pdnbdelivery$$popenCost$$pVDB$$pdriver$$pOpenAPC_DEAL$$popen_access$$popenaire
000977832 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article$$x0
000977832 915__ $$0LIC:(DE-HGF)CCBY4$$2HGFVOC$$aCreative Commons Attribution CC BY 4.0
000977832 915__ $$0StatID:(DE-HGF)0100$$2StatID$$aJCR$$bNETWORKS : 2022$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)0113$$2StatID$$aWoS$$bScience Citation Index Expanded$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)0150$$2StatID$$aDBCoverage$$bWeb of Science Core Collection$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)0160$$2StatID$$aDBCoverage$$bEssential Science Indicators$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)0199$$2StatID$$aDBCoverage$$bClarivate Analytics Master Journal List$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)0200$$2StatID$$aDBCoverage$$bSCOPUS$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)0300$$2StatID$$aDBCoverage$$bMedline$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)0420$$2StatID$$aNationallizenz$$d2023-08-26$$wger
000977832 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
000977832 915__ $$0StatID:(DE-HGF)1160$$2StatID$$aDBCoverage$$bCurrent Contents - Engineering, Computing and Technology$$d2023-08-26
000977832 915__ $$0StatID:(DE-HGF)3001$$2StatID$$aDEAL Wiley$$d2023-08-26$$wger
000977832 915__ $$0StatID:(DE-HGF)9900$$2StatID$$aIF < 5$$d2023-08-26
000977832 915pc $$0PC:(DE-HGF)0000$$2APC$$aAPC keys set
000977832 915pc $$0PC:(DE-HGF)0120$$2APC$$aDEAL: Wiley 2019
000977832 915pc $$0PC:(DE-HGF)0002$$2APC$$aDFG OA Publikationskosten
000977832 9141_ $$y2024
000977832 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM06483$$aRWTH Aachen$$b0$$kRWTH
000977832 9201_ $$0I:(DE-82)125620_20210528$$k125620$$lLehr- und Forschungsgebiet Kombinatorische Optimierung$$x0
000977832 9201_ $$0I:(DE-82)120000_20140620$$k120000$$lFachgruppe Informatik$$x1
000977832 961__ $$c2024-01-29T11:24:22.105419$$x2024-01-29T11:24:22.105419$$z2024-01-29T11:24:22.105419
000977832 9801_ $$aFullTexts
000977832 980__ $$aI:(DE-82)120000_20140620
000977832 980__ $$aI:(DE-82)125620_20210528
000977832 980__ $$aUNRESTRICTED
000977832 980__ $$aVDB
000977832 980__ $$ajournal
000977832 980__ $$aAPC