{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GUK6W2VFPO2FO2YOBIKNDBBBYY","short_pith_number":"pith:GUK6W2VF","schema_version":"1.0","canonical_sha256":"3515eb6aa57bb4576b0e0a14d18421c603941df74cd5a4e8edd85a804df6d2dc","source":{"kind":"arxiv","id":"1412.6755","version":1},"attestation_state":"computed","paper":{"title":"An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tobias M\\\"omke","submitted_at":"2014-12-21T10:05:22Z","abstract_excerpt":"Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. Based on this algorithm and a novel use of orientations in graphs, we obtain a (3 beta/4 + 3 beta^2/4)-approximation algorithm for TSP with beta-relaxed triangle inequality (beta-TSP), where beta >= 1. A graph G is an instance of beta-TSP, if it is a complete graph with non-negative edge weights that are restricted as follows. For each triple of vertices u,v,w in V(G), c({u,v}) <= "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.6755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-21T10:05:22Z","cross_cats_sorted":[],"title_canon_sha256":"8deacae76aead62a3fdee7eb30c9b40e4b35b9e2e9dd986afa88c7030578f63f","abstract_canon_sha256":"e38beaeda68c9047cc9f2c240bb1445cad3cd9878e81847361ce7dc7d3b2bced"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:46.293711Z","signature_b64":"ueB+NqtB2PfcTk+WqwemJUi6ExjOa+I7Ee6EbwyV/Tsvszbx0xmUSy3NO6KsgGvKyt6/JuJVINllGYBTT1aEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3515eb6aa57bb4576b0e0a14d18421c603941df74cd5a4e8edd85a804df6d2dc","last_reissued_at":"2026-05-18T02:30:46.293307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:46.293307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tobias M\\\"omke","submitted_at":"2014-12-21T10:05:22Z","abstract_excerpt":"Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. Based on this algorithm and a novel use of orientations in graphs, we obtain a (3 beta/4 + 3 beta^2/4)-approximation algorithm for TSP with beta-relaxed triangle inequality (beta-TSP), where beta >= 1. A graph G is an instance of beta-TSP, if it is a complete graph with non-negative edge weights that are restricted as follows. For each triple of vertices u,v,w in V(G), c({u,v}) <= "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6755","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.6755","created_at":"2026-05-18T02:30:46.293378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6755v1","created_at":"2026-05-18T02:30:46.293378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6755","created_at":"2026-05-18T02:30:46.293378+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUK6W2VFPO2F","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUK6W2VFPO2FO2YO","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUK6W2VF","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY","json":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY.json","graph_json":"https://pith.science/api/pith-number/GUK6W2VFPO2FO2YOBIKNDBBBYY/graph.json","events_json":"https://pith.science/api/pith-number/GUK6W2VFPO2FO2YOBIKNDBBBYY/events.json","paper":"https://pith.science/paper/GUK6W2VF"},"agent_actions":{"view_html":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY","download_json":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY.json","view_paper":"https://pith.science/paper/GUK6W2VF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6755&json=true","fetch_graph":"https://pith.science/api/pith-number/GUK6W2VFPO2FO2YOBIKNDBBBYY/graph.json","fetch_events":"https://pith.science/api/pith-number/GUK6W2VFPO2FO2YOBIKNDBBBYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/action/storage_attestation","attest_author":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/action/author_attestation","sign_citation":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/action/citation_signature","submit_replication":"https://pith.science/pith/GUK6W2VFPO2FO2YOBIKNDBBBYY/action/replication_record"}},"created_at":"2026-05-18T02:30:46.293378+00:00","updated_at":"2026-05-18T02:30:46.293378+00:00"}