{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QYHMVRSKYBQWFHHKZS5Q5J6XRO","short_pith_number":"pith:QYHMVRSK","schema_version":"1.0","canonical_sha256":"860ecac64ac061629ceaccbb0ea7d78ba67ca67eb326c1b1c757408a710df590","source":{"kind":"arxiv","id":"1706.07475","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Approximation Algorithms for some Location Problems in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arne Leitert, Feodor F. Dragan","submitted_at":"2017-06-22T19:56:51Z","abstract_excerpt":"We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) $r$-Domination problem and the (Connected) $p$-Center problem for unweighted and undirected graphs. Given a graph $G$, we show how to construct a (connected) $\\big(r + \\mathcal{O}(\\mu) \\big)$-dominating set $D$ with $|D| \\leq |D^*|$ efficiently. Here, $D^*$ is a minimum (connected) $r$-dominating set of $G$ and $\\mu$ is our graph parameter, which is the tree-breadth or the cluster diameter in a layering partition of $G$. Additionally, we show that a $+ \\mathcal{O}(\\mu)$-approximation for the ("},"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":"1706.07475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-22T19:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"03a22e32e76b12480a6bb9a63bb356f3c0835a3517df765ef6b003c45d31ddef","abstract_canon_sha256":"618e6597d64b69bef3191b1ed72e5097e02ae65359309ea97de58279ab56f2b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:48.996063Z","signature_b64":"WT81nySJRiChl1i1R0GYYKL4cVlJQQN6tI8Ur+jKqIA2PJOQr60priFHXVwfSwsHLT4rhNmfeI8AKIcn3BQRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860ecac64ac061629ceaccbb0ea7d78ba67ca67eb326c1b1c757408a710df590","last_reissued_at":"2026-05-18T00:41:48.995346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:48.995346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Approximation Algorithms for some Location Problems in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arne Leitert, Feodor F. Dragan","submitted_at":"2017-06-22T19:56:51Z","abstract_excerpt":"We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) $r$-Domination problem and the (Connected) $p$-Center problem for unweighted and undirected graphs. Given a graph $G$, we show how to construct a (connected) $\\big(r + \\mathcal{O}(\\mu) \\big)$-dominating set $D$ with $|D| \\leq |D^*|$ efficiently. Here, $D^*$ is a minimum (connected) $r$-dominating set of $G$ and $\\mu$ is our graph parameter, which is the tree-breadth or the cluster diameter in a layering partition of $G$. Additionally, we show that a $+ \\mathcal{O}(\\mu)$-approximation for the ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07475","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":"1706.07475","created_at":"2026-05-18T00:41:48.995447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07475v1","created_at":"2026-05-18T00:41:48.995447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07475","created_at":"2026-05-18T00:41:48.995447+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYHMVRSKYBQW","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYHMVRSKYBQWFHHK","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYHMVRSK","created_at":"2026-05-18T12:31:39.905425+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/QYHMVRSKYBQWFHHKZS5Q5J6XRO","json":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO.json","graph_json":"https://pith.science/api/pith-number/QYHMVRSKYBQWFHHKZS5Q5J6XRO/graph.json","events_json":"https://pith.science/api/pith-number/QYHMVRSKYBQWFHHKZS5Q5J6XRO/events.json","paper":"https://pith.science/paper/QYHMVRSK"},"agent_actions":{"view_html":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO","download_json":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO.json","view_paper":"https://pith.science/paper/QYHMVRSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07475&json=true","fetch_graph":"https://pith.science/api/pith-number/QYHMVRSKYBQWFHHKZS5Q5J6XRO/graph.json","fetch_events":"https://pith.science/api/pith-number/QYHMVRSKYBQWFHHKZS5Q5J6XRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/action/storage_attestation","attest_author":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/action/author_attestation","sign_citation":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/action/citation_signature","submit_replication":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/action/replication_record"}},"created_at":"2026-05-18T00:41:48.995447+00:00","updated_at":"2026-05-18T00:41:48.995447+00:00"}