OUTRE
发表于 2025-3-26 22:13:23
http://reply.papertrans.cn/63/6262/626138/626138_31.png
斥责
发表于 2025-3-27 04:09:56
Online Algorithms for Disk Graphslting from intersections of disks on the plane. In particular, we investigate whether randomization can be used to break known lower bounds for deterministic on-line independent set algorithms and present new upper and lower bounds; we also present an improved upper bound for on-line coloring.
Geyser
发表于 2025-3-27 08:32:56
http://reply.papertrans.cn/63/6262/626138/626138_33.png
爆炸
发表于 2025-3-27 12:45:52
http://reply.papertrans.cn/63/6262/626138/626138_34.png
DEBT
发表于 2025-3-27 15:10:27
http://reply.papertrans.cn/63/6262/626138/626138_35.png
fructose
发表于 2025-3-27 21:51:20
On Approximation Hardness of the Minimum 2SAT-DELETION Problem hierarchy of minimization problems , and its approximability is largely open. We prove a lower approximation bound of ., improving the previous bound of . by Dinur and Safra . For highly restricted instances with exactly 4 occurrences of every variable we provide a lower bound of .. Both inap
精致
发表于 2025-3-27 22:26:49
Group Coloring and List Group Coloring Are Π, ,-Completeignment ., there exists a vertex-coloring .: .(.)→ . with .(.)∈ .(.) for each vertex . and with . for each oriented edge . of .. We prove a dichotomy result on the computational complexity of this problem. In particular, we show that the problem is Π.-complete if ℓ≥ 3 for any group . and it is polyn
珐琅
发表于 2025-3-28 04:28:28
http://reply.papertrans.cn/63/6262/626138/626138_38.png
delegate
发表于 2025-3-28 09:32:18
Equitable Colorings of Bounded Treewidth Graphs has size at most ℓ. We consider the problems to determine for a given graph . (and a given integer ℓ) whether . has an equitable (ℓ-bounded) .-coloring. We prove that both problems can be solved in polynomial time on graphs of bounded treewidth, and show that a precolored version remains NP-complete on trees.
objection
发表于 2025-3-28 11:16:29
Online Algorithms for Disk Graphslting from intersections of disks on the plane. In particular, we investigate whether randomization can be used to break known lower bounds for deterministic on-line independent set algorithms and present new upper and lower bounds; we also present an improved upper bound for on-line coloring.