{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S54SN2RJ2LPDC4ISP25JZ72ZOU","short_pith_number":"pith:S54SN2RJ","schema_version":"1.0","canonical_sha256":"977926ea29d2de3171127eba9cff59750ad9842710025574db371e1f51132ec0","source":{"kind":"arxiv","id":"1301.5070","version":2},"attestation_state":"computed","paper":{"title":"Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Hong Shen, Kewen Liao, Longkun Guo","submitted_at":"2013-01-22T04:52:06Z","abstract_excerpt":"For a given graph $G$ with positive integral cost and delay on edges, distinct vertices $s$ and $t$, cost bound $C\\in Z^{+}$ and delay bound $D\\in Z^{+}$, the $k$ bi-constraint path ($k$BCP) problem is to compute $k$ disjoint $st$-paths subject to $C$ and $D$. This problem is known NP-hard, even when $k=1$ \\cite{garey1979computers}. This paper first gives a simple approximation algorithm with factor-$(2,2)$, i.e. the algorithm computes a solution with delay and cost bounded by $2*D$ and $2*C$ respectively. Later, a novel improved approximation algorithm with ratio $(1+\\beta,\\,\\max\\{2,\\,1+\\ln\\f"},"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":"1301.5070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-22T04:52:06Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"55eb474bd6f3fc803b9e738676b832def24f8fbd445c24717f1c2fa576ed17f2","abstract_canon_sha256":"10e6502df95a0d89c63617542299ac9da57bffce950c23f1138d7d8bc27cdfd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:06.348156Z","signature_b64":"pgxiQR1c8+fgaKwFgcnk6AEUK+w6mL5inLQLYv9dT5eNGDX1CvVpGPklSJYPyEDe6PZSJTPrU8rPAbG9hQZmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"977926ea29d2de3171127eba9cff59750ad9842710025574db371e1f51132ec0","last_reissued_at":"2026-05-18T03:29:06.347697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:06.347697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Hong Shen, Kewen Liao, Longkun Guo","submitted_at":"2013-01-22T04:52:06Z","abstract_excerpt":"For a given graph $G$ with positive integral cost and delay on edges, distinct vertices $s$ and $t$, cost bound $C\\in Z^{+}$ and delay bound $D\\in Z^{+}$, the $k$ bi-constraint path ($k$BCP) problem is to compute $k$ disjoint $st$-paths subject to $C$ and $D$. This problem is known NP-hard, even when $k=1$ \\cite{garey1979computers}. This paper first gives a simple approximation algorithm with factor-$(2,2)$, i.e. the algorithm computes a solution with delay and cost bounded by $2*D$ and $2*C$ respectively. Later, a novel improved approximation algorithm with ratio $(1+\\beta,\\,\\max\\{2,\\,1+\\ln\\f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5070","kind":"arxiv","version":2},"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":"1301.5070","created_at":"2026-05-18T03:29:06.347776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5070v2","created_at":"2026-05-18T03:29:06.347776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5070","created_at":"2026-05-18T03:29:06.347776+00:00"},{"alias_kind":"pith_short_12","alias_value":"S54SN2RJ2LPD","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S54SN2RJ2LPDC4IS","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S54SN2RJ","created_at":"2026-05-18T12:27:59.945178+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/S54SN2RJ2LPDC4ISP25JZ72ZOU","json":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU.json","graph_json":"https://pith.science/api/pith-number/S54SN2RJ2LPDC4ISP25JZ72ZOU/graph.json","events_json":"https://pith.science/api/pith-number/S54SN2RJ2LPDC4ISP25JZ72ZOU/events.json","paper":"https://pith.science/paper/S54SN2RJ"},"agent_actions":{"view_html":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU","download_json":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU.json","view_paper":"https://pith.science/paper/S54SN2RJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5070&json=true","fetch_graph":"https://pith.science/api/pith-number/S54SN2RJ2LPDC4ISP25JZ72ZOU/graph.json","fetch_events":"https://pith.science/api/pith-number/S54SN2RJ2LPDC4ISP25JZ72ZOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU/action/storage_attestation","attest_author":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU/action/author_attestation","sign_citation":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU/action/citation_signature","submit_replication":"https://pith.science/pith/S54SN2RJ2LPDC4ISP25JZ72ZOU/action/replication_record"}},"created_at":"2026-05-18T03:29:06.347776+00:00","updated_at":"2026-05-18T03:29:06.347776+00:00"}