{"dcterms:modified":"2025-07-23","dcterms:creator":"bonndata","@type":"ore:ResourceMap","schema:additionalType":"Dataverse OREMap Format v1.0.1","dvcore:generatedBy":{"@type":"schema:SoftwareApplication","schema:name":"Dataverse","schema:version":"6.6 build 1829-192cdc4","schema:url":"https://github.com/iqss/dataverse"},"@id":"https://bonndata.uni-bonn.de/catalog/datasets/10.60507/FK2/1DGUVE/exportformat/oai-ore.json","ore:describes":{"citation:subjectRefinement":{"subjectRefinementValue":"combinatorial optimization"},"citation:datasetContact":{"citation:datasetContactName":"Held, Stephan","citation:datasetContactAffiliation":"University of Bonn","citation:datasetContactEmail":"held@dm.uni-bonn.de"},"author":{"citation:authorName":"Held, Stephan","citation:authorAffiliation":"University of Bonn","authorIdentifierScheme":"ORCID","authorIdentifier":{"personName":"Held, Stephan","@id":"https://orcid.org/0000-0003-2188-1559","scheme":"ORCID","@type":"https://schema.org/Person"}},"publication":{"publicationCitation":"Georgiadis, L., Goldberg, A. V., Tarjan, R. E., & Werneck, R. F.\n\"An experimental study of minimum mean cycle algorithms\",\nin 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 1-13,\nSIAM.","publicationIDType":"isbn","publicationIDNumber":"978-0-89871-930-7","publicationURL":"https://epubs.siam.org/doi/abs/10.1137/1.9781611972894.1"},"citation:dsDescription":{"citation:dsDescriptionValue":"This data set contains some large real-world instances of the minimum mean cycle problem.\nThey are reported as the bonn01 to bonn09 instances in the paper:\n
\n
\nGeorgiadis, L., Goldberg, A. V., Tarjan, R. E., & Werneck, R. F.\n\"An experimental study of minimum mean cycle algorithms\",\nin 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 1–13,\nSIAM.\n
\n
\nThe instances arise in clock skew scheduling in chip design, e.g. see\n
\n
\nHeld, S., Korte, B., Rautenbach, D. and Vygen, J.\n\"Combinatorial optimization in VLSI design. Combinatorial Optimization\",\nin Combinatorial Optimization, NATO Science for Peace and Security Series - D: Information and Communication Security, pp. 33–96, 2011.\n
\n
\nThe clock skew scheduling problem in chip design is, given a directed graph G with edge delays d:E(G)-> R,\nfind a minimum cycle time T and arrival times (a schedule) a: V(G) -> R such that\n
\n
\n a(v) + d(v,w) <= a(w) + T for all (v,w) in E(G).\n
\n
\nG is called a latch graph. The nodes represent latches and registers, and the edges represent the longest signal paths between registers.\n
\nThe problem of minimizing T is equivalent to maximizing the worst slack min{s(v,w) := a(w) + T - a(v) - d(v,w) | (v,w) in E(G)} for a fixed cycle time T.\n\n
\n\nThe instances provided in the tar file below consist of directed graphs with edge costs c(v,w) = T - d(v,w),\ni.e. edge slacks w.r.t. a zero-skew schedule where a = 0.\nThe maximum achievable worst slack by varying the schedule 'a' equals the value of a minimum mean cycle in (G,c).\nInstance sizes range from 70346 nodes and 898220 edges to 1065274 nodes and 104340248 edges.\nOther instances are very dense, e.g. 5361 nodes and 4169878 edges.\n
\nNote that the instances may not be strongly connected or even connected.\nFormat: Ignore empty lines and lines starting with '#', then:\n1st line: number_of_nodes number_of_edges\nnext lines: from_node to_node edge_cost (i.e., zero skew slack)","citation:dsDescriptionDate":"2024-02-27"},"citation:freeKeyword":{"citation:freeKeywordValue":"mininum mean-cycle instances"},"title":"Minimum Mean Cycle Instances","subject":["Engineering","Mathematical Sciences"],"citation:depositor":"Held, Stephan","dateOfDeposit":"2024-02-27","@id":"https://doi.org/10.60507/FK2/1DGUVE","@type":["ore:Aggregation","schema:Dataset"],"schema:version":"1.0","schema:name":"Minimum Mean Cycle Instances","schema:dateModified":"Mon Mar 04 08:54:35 CET 2024","schema:datePublished":"2024-03-04","schema:creativeWorkStatus":"RELEASED","schema:license":"http://creativecommons.org/publicdomain/zero/1.0","dvcore:fileTermsOfAccess":{"dvcore:fileRequestAccess":true},"schema:includedInDataCatalog":"bonndata","schema:isPartOf":{"schema:name":"Bonn Mathematics","@id":"https://bonndata.uni-bonn.de/dataverse/math","schema:description":"Research data from all areas of Bonn mathematics.\n","schema:isPartOf":{"schema:name":"bonndata","@id":"https://bonndata.uni-bonn.de/dataverse/bonndata-root","schema:description":"

bonndata is the institutional, cross-disciplinary research data repository for the publication of research data for all researchers at the University of Bonn.\n
bonndata is provided by the University IT and Data Center and maintained by the Research Data Service Center.\n
\nReady to get started with bonndata? \n
\nHave a look at our User Guide to get to know the bonndata workflow, tips and tricks!\n
\nQuestions? Need assistance? \n
\nGet in touch: researchdata@uni-bonn.de

\n
"}},"schema:inLanguage":"en","ore:aggregates":[{"schema:name":"Held_MMC_Readme.txt","dvcore:restricted":false,"schema:version":2,"dvcore:datasetVersionId":215,"@id":"doi:10.60507/FK2/1DGUVE/IYUU0X","schema:sameAs":"https://bonndata.uni-bonn.de/catalog/downloads/4314/Held_MMC_Readme.txt","@type":"ore:AggregatedResource","schema:fileFormat":"text/plain","dvcore:filesize":3854,"dvcore:storageIdentifier":"file://18df0232287-4b25821bfb40","dvcore:rootDataFileId":-1,"dvcore:checksum":{"@type":"MD5","@value":"cb88362d49622f3677adc43b03cf9f7f"}},{"schema:name":"cyopt_instances.tar","dvcore:restricted":false,"schema:version":1,"dvcore:datasetVersionId":215,"@id":"doi:10.60507/FK2/1DGUVE/GM5JWZ","schema:sameAs":"https://bonndata.uni-bonn.de/catalog/downloads/4315/cyopt_instances.tar","@type":"ore:AggregatedResource","schema:fileFormat":"application/x-tar","dvcore:filesize":673904640,"dvcore:storageIdentifier":"file://18df023f1b0-70da123b86c3","dvcore:rootDataFileId":-1,"dvcore:checksum":{"@type":"MD5","@value":"204f7799f46c32af563064ea6325a8e2"}}],"schema:hasPart":["doi:10.60507/FK2/1DGUVE/IYUU0X","doi:10.60507/FK2/1DGUVE/GM5JWZ"]},"@context":{"author":"http://purl.org/dc/terms/creator","authorIdentifier":"http://purl.org/spar/datacite/AgentIdentifier","authorIdentifierScheme":"http://purl.org/spar/datacite/AgentIdentifierScheme","citation":"https://dataverse.org/schema/citation/","dateOfDeposit":"http://purl.org/dc/terms/dateSubmitted","dcterms":"http://purl.org/dc/terms/","dvcore":"https://dataverse.org/schema/core#","ore":"http://www.openarchives.org/ore/terms/","personName":"https://schema.org/name","publication":"http://purl.org/dc/terms/isReferencedBy","publicationCitation":"http://purl.org/dc/terms/bibliographicCitation","publicationIDNumber":"http://purl.org/spar/datacite/ResourceIdentifier","publicationIDType":"http://purl.org/spar/datacite/ResourceIdentifierScheme","publicationURL":"https://schema.org/distribution","schema":"http://schema.org/","scheme":"http://www.w3.org/2004/02/skos/core#inScheme","subject":"http://purl.org/dc/terms/subject","subjectRefinementValue":"http://purl.org/dc/terms/subject","title":"http://purl.org/dc/terms/title"}}