{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5SXFJOHZTRMLLFHKLQB6YQ6Q34","short_pith_number":"pith:5SXFJOHZ","schema_version":"1.0","canonical_sha256":"ecae54b8f99c58b594ea5c03ec43d0df0a4822a99fdf58f6115a855999988b0b","source":{"kind":"arxiv","id":"1902.03428","version":1},"attestation_state":"computed","paper":{"title":"Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Malin Rau","submitted_at":"2019-02-09T14:25:23Z","abstract_excerpt":"We study the Multiple Cluster Scheduling problem and the Multiple Strip Packing problem. For both problems, there is no algorithm with approximation ratio better than $2$ unless $P = NP$. In this paper, we present an algorithm with approximation ratio $2$ and running time $O(n)$ for both problems. While a $2$ approximation was known before, the running time of the algorithm is at least $\\Omega(n^{256})$ in the worst case. Therefore, an $O(n)$ algorithm is surprising and the best possible. We archive this result by calling an AEPTAS with approximation guarantee $(1+\\varepsilon)OPT +p_{\\max}$ an"},"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":"1902.03428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-09T14:25:23Z","cross_cats_sorted":[],"title_canon_sha256":"e8c69ac04eff375c412b416f161541ce5af3565782647b0721d88f7f352eb30d","abstract_canon_sha256":"e5703a0823fad304318fdaad9f8cb5bbc4cf92d133fa64280fdf04f964ea6b35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:20.872540Z","signature_b64":"twfdcZlP5ihFmtPsSKmnLKWjdB9LLIrdTtZk8f4JTMDQ2eAXFueKjWlmxY69CEJOrRARGJB9uJp/Q4Kx+ZxUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecae54b8f99c58b594ea5c03ec43d0df0a4822a99fdf58f6115a855999988b0b","last_reissued_at":"2026-05-17T23:54:20.871102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:20.871102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Klaus Jansen, Malin Rau","submitted_at":"2019-02-09T14:25:23Z","abstract_excerpt":"We study the Multiple Cluster Scheduling problem and the Multiple Strip Packing problem. For both problems, there is no algorithm with approximation ratio better than $2$ unless $P = NP$. In this paper, we present an algorithm with approximation ratio $2$ and running time $O(n)$ for both problems. While a $2$ approximation was known before, the running time of the algorithm is at least $\\Omega(n^{256})$ in the worst case. Therefore, an $O(n)$ algorithm is surprising and the best possible. We archive this result by calling an AEPTAS with approximation guarantee $(1+\\varepsilon)OPT +p_{\\max}$ an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03428","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":"1902.03428","created_at":"2026-05-17T23:54:20.871263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03428v1","created_at":"2026-05-17T23:54:20.871263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03428","created_at":"2026-05-17T23:54:20.871263+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SXFJOHZTRML","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SXFJOHZTRMLLFHK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SXFJOHZ","created_at":"2026-05-18T12:33:10.108867+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/5SXFJOHZTRMLLFHKLQB6YQ6Q34","json":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34.json","graph_json":"https://pith.science/api/pith-number/5SXFJOHZTRMLLFHKLQB6YQ6Q34/graph.json","events_json":"https://pith.science/api/pith-number/5SXFJOHZTRMLLFHKLQB6YQ6Q34/events.json","paper":"https://pith.science/paper/5SXFJOHZ"},"agent_actions":{"view_html":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34","download_json":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34.json","view_paper":"https://pith.science/paper/5SXFJOHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03428&json=true","fetch_graph":"https://pith.science/api/pith-number/5SXFJOHZTRMLLFHKLQB6YQ6Q34/graph.json","fetch_events":"https://pith.science/api/pith-number/5SXFJOHZTRMLLFHKLQB6YQ6Q34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34/action/storage_attestation","attest_author":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34/action/author_attestation","sign_citation":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34/action/citation_signature","submit_replication":"https://pith.science/pith/5SXFJOHZTRMLLFHKLQB6YQ6Q34/action/replication_record"}},"created_at":"2026-05-17T23:54:20.871263+00:00","updated_at":"2026-05-17T23:54:20.871263+00:00"}