激怒某人
发表于 2025-3-28 17:59:03
http://reply.papertrans.cn/16/1532/153121/153121_41.png
Pedagogy
发表于 2025-3-28 20:32:30
The School Bus Problem on Trees gap of the natural set-cover formulation for this problem is also bounded by 4. We also present a constant approximation for the variant where we have a fixed number of buses to use, and the goal is to minimize the maximum regret.
6Applepolish
发表于 2025-3-29 01:41:17
http://reply.papertrans.cn/16/1532/153121/153121_43.png
alabaster
发表于 2025-3-29 06:43:00
Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radiusication radius larger than .. to a sensor, where .. is the minimum value needed to obtain strong connectivity. We also show that Ω(log.) interference is needed for some instances, making our algorithms asymptotically optimal.
蜡烛
发表于 2025-3-29 09:32:05
Dominating Induced Matchings for ,,-free Graphs in Linear Timelexity was open for ..-free graphs for any . ≥ 5; .. denotes a chordless path with . vertices and . − 1 edges. We show in this paper that the weighted DIM problem is solvable in linear time for ..-free graphs in a robust way.
Dislocation
发表于 2025-3-29 14:11:55
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Pathsph is chordal. We use this result to show that, for any fixed graph ., the problems .-. and .-. can be solved in polynomial time on chordal graphs. These problems are to decide whether an input graph . contains . as a contraction or as an induced minor, respectively.
灯泡
发表于 2025-3-29 17:10:11
Dynamic Range Majority Data Structuresues of ., this improved query time matches an existing lower bound, for any data structure with polylogarithmic update time. We also generalize our data structure to handle sets of points in .-dimensions, for . ≥ 2, as well as dynamic arrays, in which each entry is a colour.
Glucose
发表于 2025-3-29 22:52:04
0302-9743 ernational Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as appr
nepotism
发表于 2025-3-30 00:11:25
https://doi.org/10.1007/978-3-8350-5467-7thms for problems such as MAX-CUT, MAX-3SAT, SPARSEST CUT, GRAPH COLORING, etc. The talk will survey this area, as well as its fascinating connections with topics such as geometric embeddings of metric spaces, and Khot’s unique games conjecture..The talk will be self-contained.
flaunt
发表于 2025-3-30 08:08:32
http://reply.papertrans.cn/16/1532/153121/153121_50.png