{"id":"W4402073352","doi":"10.1142/s0217595924500258","title":"Parameterized Approximations for the Minimum Diameter Vertex-Weighted Steiner Tree Problem in Graphs with Parameterized Weights","year":2024,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"National Natural Science Foundation of China; Zhejiang University of Water Resources and Electric Power","keywords":"Parameterized complexity; Steiner tree problem; Vertex (graph theory); Mathematics; Combinatorics; Treewidth; Discrete mathematics; Graph; Computer science; Pathwidth; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196341,0.0001904161,0.000297615,0.0007615389,0.0001597422,0.0004473047,0.0003396544,0.0001079304,0.00007409032],"category_scores_gemma":[0.0001097022,0.0001085691,0.0001481937,0.0008808361,0.0001544864,0.000489779,0.000020609,0.0006860921,0.00001060101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001215943,"about_ca_system_score_gemma":0.0002282883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004840435,"about_ca_topic_score_gemma":0.000009662715,"domain_scores_codex":[0.997826,0.0002070425,0.000593853,0.0002029368,0.0007728552,0.000397329],"domain_scores_gemma":[0.9974189,0.001772722,0.00004047266,0.0002235002,0.0004439053,0.0001005137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003925334,0.001262707,0.001466489,0.001913195,0.004142691,0.0007553626,0.01113688,0.004741927,0.446669,0.2016422,0.1020894,0.2202548],"study_design_scores_gemma":[0.007202032,0.004337801,0.002580898,0.00219484,0.0002292716,0.0009341044,0.002667441,0.7103587,0.05560204,0.1266386,0.08586712,0.001387153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3118955,0.008952289,0.6461742,0.009328347,0.001063738,0.007359756,0.0002201419,0.0004532977,0.0145527],"genre_scores_gemma":[0.9398755,0.0003539314,0.05865376,0.00001118968,0.00009166697,0.0004766692,0.00002013084,0.00005215037,0.0004650242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7056168,"threshold_uncertainty_score":0.4427318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04196131371238212,"score_gpt":0.3108716692094621,"score_spread":0.26891035549708,"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."}}