標(biāo)題: Titlebook: Combinatorial and Algorithmic Aspects of Networking; Third Workshop, CAAN Thomas Erlebach Conference proceedings 2006 Springer-Verlag Berli [打印本頁] 作者: False-Negative 時間: 2025-3-21 20:03
書目名稱Combinatorial and Algorithmic Aspects of Networking影響因子(影響力)
書目名稱Combinatorial and Algorithmic Aspects of Networking影響因子(影響力)學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking網(wǎng)絡(luò)公開度
書目名稱Combinatorial and Algorithmic Aspects of Networking網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking被引頻次
書目名稱Combinatorial and Algorithmic Aspects of Networking被引頻次學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking年度引用
書目名稱Combinatorial and Algorithmic Aspects of Networking年度引用學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking讀者反饋
書目名稱Combinatorial and Algorithmic Aspects of Networking讀者反饋學(xué)科排名
作者: 無能力 時間: 2025-3-21 22:02
The Price of Anarchy in Selfish Multicast Routinginimum consumption of the network. Both are 1 in the unicast case. Our lower bound of .., where in the general situation we have .>1, shows an exponential increase compared to the Roughgarden bound of .(./ln.) for the unicast model. This exhibits the contrast to the unicast case, where we have Rough作者: STING 時間: 2025-3-22 02:46 作者: myalgia 時間: 2025-3-22 07:43
https://doi.org/10.1007/978-3-319-33201-7inimum consumption of the network. Both are 1 in the unicast case. Our lower bound of .., where in the general situation we have .>1, shows an exponential increase compared to the Roughgarden bound of .(./ln.) for the unicast model. This exhibits the contrast to the unicast case, where we have Rough作者: 連系 時間: 2025-3-22 10:39 作者: 魯莽 時間: 2025-3-22 12:57 作者: 魯莽 時間: 2025-3-22 17:44
Hiroto Yasuura,Chong-Min Kyung,Youn-Long Linss than the dimension . of the space. In this paper, we study the case .≤., providing several tight upper and lower bounds on approximation factors of known heuristics for minimum energy broadcasting in the .-dimensional Euclidean space.作者: 廣告 時間: 2025-3-22 22:56
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSPr tolerance with respect to one of the relaxed ATSP. The improved algorithm produces higher-quality tours than all previous COP versions and is clearly outperforming all other construction heuristics on robustness.作者: Deadpan 時間: 2025-3-23 02:38 作者: 匍匐 時間: 2025-3-23 06:10 作者: 谷類 時間: 2025-3-23 10:20
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphscular-arc graph..Two variants of the problem are considered: . and .. In ., the messages have unit demands, whereas in . demands are arbitrary. We present an optimal algorithm for . and a 3-approximation algorithm for ..作者: 構(gòu)想 時間: 2025-3-23 15:48
https://doi.org/10.1007/978-3-319-33201-7o another station . must satisfy the inequality ., where .(.,.) is the Euclidean distance between . and . and .≥1 is the .. The value of . may vary from 1 to more than 6 depending on the environment conditions at the location of the network (see [16]).作者: kindred 時間: 2025-3-23 21:50
Chong-Min Kyung,Hiroto Yasuura,Youn-Long Linfixed bound associated with the node. First, we prove that the problem is hard to approximate within better than a logarithmic factor, unless . admits slightly superpolynomial time algorithms. Then, we provide a truthful . mechanism for the problem, which guarantees an approximation factor of (1+.)(.–1), for any .>0.作者: laparoscopy 時間: 2025-3-24 00:30 作者: 輕信 時間: 2025-3-24 05:23
Basics and Advances in Monocular vSLAM,tee of ., where . is the cost of an optimal solution, . is the number of lightpaths, and ., for any given odd .. Without preprocessing phase (i.e. .=1), this reduces to .. We develop a new technique for the analysis of the upper bound and prove a tight bound of . for the performance of this algorithm.作者: SIT 時間: 2025-3-24 08:14 作者: depreciate 時間: 2025-3-24 12:04 作者: intuition 時間: 2025-3-24 18:52 作者: glacial 時間: 2025-3-24 20:52 作者: averse 時間: 2025-3-24 23:21 作者: 并排上下 時間: 2025-3-25 07:19
Hiroto Yasuura,Chong-Min Kyung,Youn-Long Linng task with high probability in any radio network of size .. This matches the lower bound of Ω(.log.) by G?sieniec and Potapov in [17] [TCS’02]. Our new gossiping schedule is based on the notion of a gathering spanning tree proposed by G?sieniec, Peleg and Xin in [19] [PODC’05].作者: 偶然 時間: 2025-3-25 10:46 作者: 陪審團(tuán) 時間: 2025-3-25 14:11
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networksng task with high probability in any radio network of size .. This matches the lower bound of Ω(.log.) by G?sieniec and Potapov in [17] [TCS’02]. Our new gossiping schedule is based on the notion of a gathering spanning tree proposed by G?sieniec, Peleg and Xin in [19] [PODC’05].作者: 幻想 時間: 2025-3-25 19:06
Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wn and connected by wireless links. Each station is assigned a transmission range, and a station . can correctly receive the transmission of another station . if and only if . is within the range of .. The overall range assignment, .: .→.., determines a (directed) transmission graph ... The transmiss作者: predict 時間: 2025-3-25 23:53
The Price of Anarchy in Selfish Multicast Routingory for the unicast situation, and exhibiting new phenomena not present in the unicast model. In the multicast model we have . commodities (or player classes), where for each ., a flow from a source .. to a finite number of terminals . has to be routed such that every terminal ... receives flow ..∈?作者: Ophthalmologist 時間: 2025-3-26 02:14
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problemch privately holds a pair of values associated with the edge, namely its . and its .. In this paper we analyze the problem of designing a truthful mechanism for computing a . of . rooted at a fixed node . ∈. having minimum cost (as computed w.r.t. the cost function) among all the spanning arborescen作者: 思考而得 時間: 2025-3-26 07:00 作者: 神圣在玷污 時間: 2025-3-26 09:25
Distributed Routing in Tree Networks with Few Landmarksrouting. A mobile agent, situated in a starting node, has to walk to a target node traversing a path of minimum length. All information about adjacencies is distributed to certain nodes called landmarks. We wish to minimize the total memory requirements as well as keep the memory requirements per la作者: 暗指 時間: 2025-3-26 13:47 作者: 令人苦惱 時間: 2025-3-26 17:55 作者: PTCA635 時間: 2025-3-26 21:25 作者: ALIBI 時間: 2025-3-27 04:23 作者: persistence 時間: 2025-3-27 06:51
Minimum-Energy Broadcasting in Wireless Networks in the ,-Dimensional Euclidean Space (The ,≤, Case)des is possible. This problem has been extensively studied especially under the assumption that the nodes correspond to points in the Euclidean two- or three-dimensional space and the broadcast range of a node is proportional to at most the . root of the energy assigned to the node where . is not le作者: 鞭子 時間: 2025-3-27 12:25
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networkstwork. We study the gossiping problem in known topology radio networks where the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology of the network. In addition we consider the case where it is only possible to transmit a unit size message in e作者: neoplasm 時間: 2025-3-27 14:43
Combinatorial and Algorithmic Aspects of Networking978-3-540-48824-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: pacifist 時間: 2025-3-27 18:17 作者: Manifest 時間: 2025-3-27 23:59 作者: 極大痛苦 時間: 2025-3-28 03:27
https://doi.org/10.1007/11922377Broadcast; Internet; QoS; Roadcasting; Routing; Topologie; approximation algorithms; combinatorics; communic作者: 擔(dān)心 時間: 2025-3-28 06:44
978-3-540-48822-4Springer-Verlag Berlin Heidelberg 2006作者: 神圣在玷污 時間: 2025-3-28 13:26
https://doi.org/10.1007/978-3-319-33201-7n and connected by wireless links. Each station is assigned a transmission range, and a station . can correctly receive the transmission of another station . if and only if . is within the range of .. The overall range assignment, .: .→.., determines a (directed) transmission graph ... The transmiss作者: Oscillate 時間: 2025-3-28 16:45 作者: 支柱 時間: 2025-3-28 19:06 作者: 農(nóng)學(xué) 時間: 2025-3-28 23:50 作者: Mhc-Molecule 時間: 2025-3-29 05:03
https://doi.org/10.1007/978-3-319-33201-7routing. A mobile agent, situated in a starting node, has to walk to a target node traversing a path of minimum length. All information about adjacencies is distributed to certain nodes called landmarks. We wish to minimize the total memory requirements as well as keep the memory requirements per la作者: 壓艙物 時間: 2025-3-29 07:32
Do Hoon Lee,Wonbin Song,Byung Yang Leea set of messages and a conflict graph that specifies which messages cannot be transmitted concurrently. In our model the conflict graph is a unit circular-arc graph..Two variants of the problem are considered: . and .. In ., the messages have unit demands, whereas in . demands are arbitrary. We pre作者: 套索 時間: 2025-3-29 11:23 作者: vector 時間: 2025-3-29 19:13 作者: OMIT 時間: 2025-3-29 20:08
Smart Sensors at the IoT Frontiereveral forbidden patterns of AS relationships that impose a certain type of acyclicity on the AS graph. We investigate algorithms for solving the . problem, i.e., given a set of AS paths, find an orientation of the edges according to some types of AS relationships such that the oriented AS graph is
