{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PR5YJH6AT2OMTJHSGFDNHD35ZF","short_pith_number":"pith:PR5YJH6A","schema_version":"1.0","canonical_sha256":"7c7b849fc09e9cc9a4f23146d38f7dc967b8ea1e4fe84c4dca12526ab407264f","source":{"kind":"arxiv","id":"1605.02530","version":3},"attestation_state":"computed","paper":{"title":"Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Emil Feldmann","submitted_at":"2016-05-09T11:24:00Z","abstract_excerpt":"We consider the $k$-Center problem and some generalizations. For $k$-Center a set of $k$ center vertices needs to be found in a graph $G$ with edge lengths, such that the distance from any vertex of $G$ to its nearest center is minimized. This problem naturally occurs in transportation networks, and therefore we model the inputs as graphs with bounded highway dimension, as proposed by Abraham et al. [SODA 2010].\n  We show both approximation and fixed-parameter hardness results, and how to overcome them using fixed-parameter approximations, where the two paradigms are combined. In particular, w"},"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":"1605.02530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-09T11:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"c660daf4bfec35ec0c3437a80969573d7ba01fe68d384ce152bdc9e3652cd8e2","abstract_canon_sha256":"7e9322163b46e7abaa615111c719a69099171f5b435416301d6d5b25c5fb03b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.629520Z","signature_b64":"V5Y4cKTRtt92eTxw7jKBjtnrl6aJcd4sWauk2wt6EWKsAk4u6E/bPvmsLHGMFCZXq5QRdyzg4RrXW+vqtxu8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c7b849fc09e9cc9a4f23146d38f7dc967b8ea1e4fe84c4dca12526ab407264f","last_reissued_at":"2026-05-17T23:47:44.628921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.628921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Emil Feldmann","submitted_at":"2016-05-09T11:24:00Z","abstract_excerpt":"We consider the $k$-Center problem and some generalizations. For $k$-Center a set of $k$ center vertices needs to be found in a graph $G$ with edge lengths, such that the distance from any vertex of $G$ to its nearest center is minimized. This problem naturally occurs in transportation networks, and therefore we model the inputs as graphs with bounded highway dimension, as proposed by Abraham et al. [SODA 2010].\n  We show both approximation and fixed-parameter hardness results, and how to overcome them using fixed-parameter approximations, where the two paradigms are combined. In particular, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02530","kind":"arxiv","version":3},"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":"1605.02530","created_at":"2026-05-17T23:47:44.629005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02530v3","created_at":"2026-05-17T23:47:44.629005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02530","created_at":"2026-05-17T23:47:44.629005+00:00"},{"alias_kind":"pith_short_12","alias_value":"PR5YJH6AT2OM","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PR5YJH6AT2OMTJHS","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PR5YJH6A","created_at":"2026-05-18T12:30:39.010887+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/PR5YJH6AT2OMTJHSGFDNHD35ZF","json":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF.json","graph_json":"https://pith.science/api/pith-number/PR5YJH6AT2OMTJHSGFDNHD35ZF/graph.json","events_json":"https://pith.science/api/pith-number/PR5YJH6AT2OMTJHSGFDNHD35ZF/events.json","paper":"https://pith.science/paper/PR5YJH6A"},"agent_actions":{"view_html":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF","download_json":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF.json","view_paper":"https://pith.science/paper/PR5YJH6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02530&json=true","fetch_graph":"https://pith.science/api/pith-number/PR5YJH6AT2OMTJHSGFDNHD35ZF/graph.json","fetch_events":"https://pith.science/api/pith-number/PR5YJH6AT2OMTJHSGFDNHD35ZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/action/storage_attestation","attest_author":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/action/author_attestation","sign_citation":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/action/citation_signature","submit_replication":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/action/replication_record"}},"created_at":"2026-05-17T23:47:44.629005+00:00","updated_at":"2026-05-17T23:47:44.629005+00:00"}