{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FJVX4IBRK3HSBPT6CGRKZXWBRM","short_pith_number":"pith:FJVX4IBR","schema_version":"1.0","canonical_sha256":"2a6b7e203156cf20be7e11a2acdec18b331fa748b619c5cb00cb8a82019fcea9","source":{"kind":"arxiv","id":"1703.01640","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms for TSP with neighborhoods in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Joseph S. B. Mitchell","submitted_at":"2017-03-05T18:24:23Z","abstract_excerpt":"In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. In this paper, we present new approximation results for the TSPN, including (1) a constant-factor approximation algorithm for the case of arbitrary connected neighborhoods having comparable diameters; and (2) a PTAS for the important special case of disjoint unit disk neighborhoods (or nearly disjoint, nearly-unit disks). Our methods also yield improved approximation "},"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":"1703.01640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-05T18:24:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7f1939f06d6fa5931639a09a0e776c6600207e68f5bd5d5e96e2d370731f196c","abstract_canon_sha256":"78e95daa7d65a698777a3b1c2cd4cb9e424e84fecff281a97be7e6cd885b2a9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:30.027495Z","signature_b64":"LsnLctdfYkzMH5gN7SaXVER5KcPt6lI+utF176ScX4QdhyInyzr13auH7+KhquFYa8f6Fdqq2XO8ALSdQkUDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6b7e203156cf20be7e11a2acdec18b331fa748b619c5cb00cb8a82019fcea9","last_reissued_at":"2026-05-18T00:49:30.026800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:30.026800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for TSP with neighborhoods in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Joseph S. B. Mitchell","submitted_at":"2017-03-05T18:24:23Z","abstract_excerpt":"In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. In this paper, we present new approximation results for the TSPN, including (1) a constant-factor approximation algorithm for the case of arbitrary connected neighborhoods having comparable diameters; and (2) a PTAS for the important special case of disjoint unit disk neighborhoods (or nearly disjoint, nearly-unit disks). Our methods also yield improved approximation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01640","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":"1703.01640","created_at":"2026-05-18T00:49:30.026902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01640v1","created_at":"2026-05-18T00:49:30.026902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01640","created_at":"2026-05-18T00:49:30.026902+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJVX4IBRK3HS","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJVX4IBRK3HSBPT6","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJVX4IBR","created_at":"2026-05-18T12:31:15.632608+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/FJVX4IBRK3HSBPT6CGRKZXWBRM","json":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM.json","graph_json":"https://pith.science/api/pith-number/FJVX4IBRK3HSBPT6CGRKZXWBRM/graph.json","events_json":"https://pith.science/api/pith-number/FJVX4IBRK3HSBPT6CGRKZXWBRM/events.json","paper":"https://pith.science/paper/FJVX4IBR"},"agent_actions":{"view_html":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM","download_json":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM.json","view_paper":"https://pith.science/paper/FJVX4IBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01640&json=true","fetch_graph":"https://pith.science/api/pith-number/FJVX4IBRK3HSBPT6CGRKZXWBRM/graph.json","fetch_events":"https://pith.science/api/pith-number/FJVX4IBRK3HSBPT6CGRKZXWBRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM/action/storage_attestation","attest_author":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM/action/author_attestation","sign_citation":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM/action/citation_signature","submit_replication":"https://pith.science/pith/FJVX4IBRK3HSBPT6CGRKZXWBRM/action/replication_record"}},"created_at":"2026-05-18T00:49:30.026902+00:00","updated_at":"2026-05-18T00:49:30.026902+00:00"}