{"id":"W3143897082","doi":"10.1007/s10878-021-00757-7","title":"The Steiner cycle and path cover problem on interval graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Surrey Memorial Hospital; Simon Fraser University; Fraser Health","funders":"Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Steiner tree problem; Combinatorics; Mathematics; Hamiltonian path; Path (computing); Cover (algebra); Longest path problem; Discrete mathematics; Set cover problem; Dominating set; Graph; Shortest path problem; Computer science; Set (abstract data type); Vertex (graph theory)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640234,0.0005603098,0.000774765,0.0008420789,0.000534435,0.001296585,0.00112322,0.0009284772,0.005524217],"category_scores_gemma":[0.003972895,0.0004306571,0.0007920185,0.002202701,0.000684744,0.00302941,0.00118193,0.001075214,0.0005199015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009718993,"about_ca_system_score_gemma":0.0008165895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002166192,"about_ca_topic_score_gemma":0.001654041,"domain_scores_codex":[0.9988411,0.0002596347,0.00007224743,0.0002744271,0.0003488649,0.0002037157],"domain_scores_gemma":[0.9980593,0.001310362,0.000193685,0.0002332772,0.0001208696,0.00008248673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006638421,0.0002322238,0.001994024,0.0008917566,0.0001061551,0.0007036569,0.0004371639,0.3832884,0.01179366,0.2755681,0.01758325,0.3067379],"study_design_scores_gemma":[0.0001098658,0.0002042195,0.001092373,0.0000680897,0.00005388095,0.0009611156,0.0002708604,0.6601647,0.006654923,0.3166791,0.01369688,0.00004406767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.116403,0.001571207,0.8611429,0.0008087613,0.00008134713,0.0002434864,0.001185848,0.0007084962,0.01785491],"genre_scores_gemma":[0.5990053,0.001762331,0.3900341,0.0002130236,0.0001566576,0.0002669411,0.002487039,0.000216866,0.005857678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005524217,"threshold_uncertainty_score":0.01848036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004398170932766899,"score_gpt":0.1978950734039759,"score_spread":0.193496902471209,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}