{"id":"W2406451447","doi":"10.1007/978-3-319-26626-8_47","title":"Approximating the Restricted 1-Center in Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Saddle point; Center (category theory); Approximation algorithm; Separable space; Vertex (graph theory); Binary logarithm; Mathematics; Matrix (chemical analysis); Scaling; Distance matrix; Shortest path problem; Discrete mathematics; Graph; Geometry; Mathematical analysis","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.001275087,0.002057087,0.00217696,0.001723989,0.001425574,0.003031551,0.004387176,0.002328253,0.01095238],"category_scores_gemma":[0.009498141,0.001063837,0.001200295,0.002511501,0.002494849,0.006277364,0.004264705,0.003640775,0.003020274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002720702,"about_ca_system_score_gemma":0.001117679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003343323,"about_ca_topic_score_gemma":0.005007734,"domain_scores_codex":[0.9984903,0.0004759361,0.00004533545,0.000402446,0.0003125656,0.0002733538],"domain_scores_gemma":[0.9947572,0.002897348,0.0004042293,0.001166004,0.0003706348,0.000404688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001345687,0.0004225078,0.002660519,0.0009829485,0.0001149424,0.0002100251,0.0007363471,0.2617821,0.009785781,0.5246081,0.04091718,0.1564339],"study_design_scores_gemma":[0.00009305326,0.00008406148,0.0003893929,0.00007052576,0.00004868605,0.0001542334,0.0001578977,0.3257788,0.003234665,0.6639787,0.005983235,0.00002665314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2798967,0.002305228,0.6600149,0.002304211,0.0003724579,0.0001849642,0.001192439,0.004243554,0.04948549],"genre_scores_gemma":[0.6962687,0.001429492,0.2782349,0.0007213681,0.0003567012,0.000211409,0.00194775,0.001825049,0.01900454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01095238,"threshold_uncertainty_score":0.03663939,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03875089561815854,"score_gpt":0.2610966215960094,"score_spread":0.2223457259778509,"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."}}