HBA1C
发表于 2025-3-21 17:03:07
书目名称Approximation and Online Algorithms影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0160419<br><br> <br><br>书目名称Approximation and Online Algorithms读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0160419<br><br> <br><br>
chlorosis
发表于 2025-3-21 22:18:58
Independent Set with Advice: The Impact of Graph Knowledgehe size of the advice needed to solve the problem efficiently. On one hand, we show that, for sparse graphs, constant-size advice is sufficient to solve the maximum independent set problem with constant competitive ratio, even with no knowledge of the underlying graph. On the other hand, we show a l
Palate
发表于 2025-3-22 01:23:14
Online Multi-Commodity Flow with High Demands than the edge capacities of the network..We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor..The algorithm can handle two types of flow
Palpate
发表于 2025-3-22 07:41:06
http://reply.papertrans.cn/17/1605/160419/160419_4.png
心胸开阔
发表于 2025-3-22 12:08:23
http://reply.papertrans.cn/17/1605/160419/160419_5.png
男生戴手铐
发表于 2025-3-22 13:18:29
http://reply.papertrans.cn/17/1605/160419/160419_6.png
Expiration
发表于 2025-3-22 18:43:11
Probabilistic ,-Median Clustering in Data Streamsn problem in the metric and Euclidean case. The coresets are of size poly(..,.,log(./(.. ·.. ·.))), where . is the expected total weight of the weighted probabilistic input points, .. is the minimum weight of a probabilistic input point, .. is the minimum realization probability, and . is the error
PLUMP
发表于 2025-3-22 23:29:19
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphslication in wireless ad-hoc networks. Since the minimum dominating set problem for unit disk graphs is NP-hard, several approximation algorithms with different merits have been proposed in the literature. On one extreme, there is a linear time 5-approximation algorithm. On another extreme, there are
Valves
发表于 2025-3-23 01:57:15
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoodss in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. We consider both minimizing and maximizing the weight of the MST over the input. The minimum weight version of the problem is known as the minimum spanning tree
拥挤前
发表于 2025-3-23 05:52:36
http://reply.papertrans.cn/17/1605/160419/160419_10.png