浮夸
发表于 2025-4-1 02:19:28
http://reply.papertrans.cn/24/2339/233820/233820_61.png
国家明智
发表于 2025-4-1 07:16:50
A Tight Lower Bound for Steiner Orientation,st optimal..In this paper, we give a short and easy proof that the . algorithm of Cygan et al. is asymptotically optimal, even if the input graph has genus 1. Formally, we show that the . problem is W-hard parameterized by the number . of terminal pairs, and, under ETH, cannot be solved in . time
flammable
发表于 2025-4-1 12:24:52
http://reply.papertrans.cn/24/2339/233820/233820_63.png
optic-nerve
发表于 2025-4-1 18:05:19
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized,e (.). Furthermore, we obtain improved algorithms for conflict free version of several well studied problems. Next, we show that if . is characterized by a “well-behaved” infinite family of forbidden induced subgraphs, then .-.-. is .-hard. Motivated by this hardness result, we consider the paramete