{"paper":{"title":"Bounds and approximation results for scheduling coupled-tasks with compatibility constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Benoit Darties (Le2i, Gilles Simonin, Jean-Claude K\\\"onig (MAORE), MAORE), Rodolphe Giroudeau (MAORE)","submitted_at":"2017-06-07T14:14:28Z","abstract_excerpt":"This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints  according to classical complexity hypothesis  ($\\mathcal{P} \\neq \\mathcal{NP}$, $\\mathcal{ETH}$). Moreover, we develop  an efficient polynomial-time approximation algorithm for the specific case for which the topology describing the compatibility constraints is a quasi split-graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02200","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"}