{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1363767","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1363767","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1363767","kernelVersion":"v1","immutable":true,"modified":"2025-12-24T22:38:39Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1363767","name":"\\((p-1)/(p+1)\\)-approximate algorithms for \\(p\\)-traveling salesmen problems on a tree with minmax objective","headline":"\\((p-1)/(p+1)\\)-approximate algorithms for \\(p\\)-traveling salesmen problems on a tree with minmax objective","description":"scientific article; zbMATH DE number 1047186","url":"https://portal.mardi4nfdi.de/entity/Q1363767","datePublished":"1997-08-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q185363"},{"@id":"https://portal.mardi4nfdi.de/entity/Q238090"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96294"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/S0166-218X(97)89161-5","url":"https://doi.org/10.1016/S0166-218X(97)89161-5"},"sameAs":["https://doi.org/10.1016/S0166-218X(97)89161-5"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1917344"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4198056"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3325496"}]},"provenance":{"prov:generatedAtTime":"2025-12-24T22:38:39Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}