標(biāo)題: Titlebook: Combinatorial and Algorithmic Aspects of Networking; First Workshop on Co Alejandro López-Ortiz,Angèle M. Hamel Conference proceedings 2005 [打印本頁] 作者: Interjection 時(shí)間: 2025-3-21 19:52
書目名稱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é)科排名
作者: Anhydrous 時(shí)間: 2025-3-22 00:02
Jinhwan Jung,Deawoo Kim,Hankyeol Lee,Yung Yitraffic equilibrium reached by the selfish users who are conscious of both the travel latencies and the taxes will minimize the social cost, i.e., will minimize the total latency..Optimal taxes incur desirable behavior from the society point of view but they cause disutility to the network users sin作者: placebo 時(shí)間: 2025-3-22 00:56 作者: Popcorn 時(shí)間: 2025-3-22 08:01
https://doi.org/10.1007/978-3-030-52624-5d . ≤ . represent the capacity constraints. We consider the class of . utility functions, consisting of functions . that are symmetric, non-decreasing, concave, and satisfy .(0) = 0. We present a single dual update subroutine that results in a primal solution which is a logarithmic approximation, si作者: Priapism 時(shí)間: 2025-3-22 11:20
S. Chandragandhi,E. Udayakumar,K. Srihari link structure of existing nodes, and a certain number of additional random links are introduced. Our model parametrizes the number of random links, thereby allowing for the analysis of threshold behaviour. We consider infinite limits of graphs generated by our model, and compare properties of thes作者: 衰弱的心 時(shí)間: 2025-3-22 13:37 作者: 衰弱的心 時(shí)間: 2025-3-22 18:15 作者: BACLE 時(shí)間: 2025-3-23 00:22 作者: 季雨 時(shí)間: 2025-3-23 02:48 作者: Organization 時(shí)間: 2025-3-23 07:03
Jan-Hendrik Heinen,Jens P?ppelbu?sed on maximum weight matching scheduling algorithms, which are computationally very complex and on the computationally less complex maximal weight matching algorithms which require a speedup of two to guarantee the stability of the switch. For practical purposes, neither a high computational comple作者: 夜晚 時(shí)間: 2025-3-23 11:19
Paul Christoph Gembarski,Roland Lachmayer this paper, we consider the problem of how to obtain a prescribed level of connectivity with a minimum number of nodes connecting to the external network..Let . = (.,.) be a digraph. A subset?. of vertices in?. may be chosen, the so-called external vertices. An internal path is a normal directed pa作者: placebo-effect 時(shí)間: 2025-3-23 17:34
Volker Nissen,Torsten Gollhardtegree distribution, average distance), it is based on some real-world observations, and it is sufficiently simple to make it possible to prove its main properties. This model consists in sampling a random bipartite graph with prescribed degree distribution. Indeed, we show that any can be viewed as 作者: Gentry 時(shí)間: 2025-3-23 21:44
Jan-Hendrik Heinen,Jens P?ppelbu? to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. Here we explore these biases and provide a statistical analysis of their origin. We derive a mean-field analytical approximation for the probability 作者: Embolic-Stroke 時(shí)間: 2025-3-23 23:06 作者: 碌碌之人 時(shí)間: 2025-3-24 03:59
Introduction to Smart Service Designontrivial, and complex data structures make an important contribution in this regard. This article surveys the three main approaches to the problem and investigates the associated data structures and algorithms. We also explore variations on these approaches and conclude with a discussion of current作者: Pelago 時(shí)間: 2025-3-24 07:54 作者: 中世紀(jì) 時(shí)間: 2025-3-24 10:45
0302-9743 Overview: 978-3-540-27873-3978-3-540-31860-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 知道 時(shí)間: 2025-3-24 15:13
https://doi.org/10.1007/978-3-642-37006-9 finds a Hamiltonian cycle in . with high probability when ., and terminates in linear worst-case number of pulses, and in expected .(..) pulses. The algorithm requires, in each node of the network, only .(.) space and .(.) internal instructions.作者: Forage飼料 時(shí)間: 2025-3-24 22:49
Introduction to Smart Service Designontrivial, and complex data structures make an important contribution in this regard. This article surveys the three main approaches to the problem and investigates the associated data structures and algorithms. We also explore variations on these approaches and conclude with a discussion of current trends.作者: FUME 時(shí)間: 2025-3-24 23:27
A Distributed Algorithm to Find Hamiltonian Cycles in , Random Graphs finds a Hamiltonian cycle in . with high probability when ., and terminates in linear worst-case number of pulses, and in expected .(..) pulses. The algorithm requires, in each node of the network, only .(.) space and .(.) internal instructions.作者: 脊椎動(dòng)物 時(shí)間: 2025-3-25 06:04 作者: 朋黨派系 時(shí)間: 2025-3-25 11:05 作者: G-spot 時(shí)間: 2025-3-25 13:57
https://doi.org/10.1007/978-3-030-58182-4The web graph has been the focus of much recent attention, with several stochastic models proposed to account for its various properties. A survey of these models is presented, focussing on the models which have been defined and analyzed rigorously.作者: 刪減 時(shí)間: 2025-3-25 17:19 作者: Cupidity 時(shí)間: 2025-3-25 23:13
https://doi.org/10.1007/978-3-030-58182-4In this paper we present a short overview of selected topics in the field of Algorithmic Foundations of the Internet, which is a new area within theoretical computer science.作者: 紅潤(rùn) 時(shí)間: 2025-3-26 03:08
Algorithmic Foundations of the Internet:ForewordDuring the last 25 years the Internet has grown from being a small academic network connecting a few computer science departments to its present size, connecting more than 285 million computers and serving over 800 million users worldwide [7].作者: forecast 時(shí)間: 2025-3-26 06:38 作者: 失眠癥 時(shí)間: 2025-3-26 10:08 作者: 漫步 時(shí)間: 2025-3-26 14:55 作者: 珊瑚 時(shí)間: 2025-3-26 19:19
https://doi.org/10.1007/11527954algorithms; combinatorics; communication networks; complexity; data stream analysis; economics, game theo作者: Vaginismus 時(shí)間: 2025-3-26 22:49 作者: 泰然自若 時(shí)間: 2025-3-27 04:51
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230033.jpg作者: micronized 時(shí)間: 2025-3-27 08:48 作者: 故意釣到白楊 時(shí)間: 2025-3-27 12:19 作者: CLASH 時(shí)間: 2025-3-27 14:38
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routingseparates . and . with respect to all valid paths, we give a 2-approximation algorithm and prove that the problem is .-hard. The corresponding problem for edge cuts is shown to be polynomial-time solvable. We present additional results for acyclic graphs.作者: 鄙視 時(shí)間: 2025-3-27 20:03
The External Network Problem with Edge- or Arc-Connectivity Requirementsere are?. arc-disjoint paths ( which may be internal or external ) from?. to?...We present polynomial algorithms that, given a digraph?. and positive integer?., will find a set of external vertices?. of minimum size subject to the requirement that (.,.) must be externally-.-arc-strong.作者: Rheumatologist 時(shí)間: 2025-3-28 00:38 作者: Contracture 時(shí)間: 2025-3-28 04:55 作者: 飛鏢 時(shí)間: 2025-3-28 07:27
https://doi.org/10.1007/978-3-030-52624-5multaneously, for all canonical utility functions. The dual update subroutine lends itself to an efficient distributed implementation..We then employ the fractional packing framework to prove that at most .(. log .) iterations of the dual update subroutine are required; here . is the number of edges in the network.作者: 愛得痛了 時(shí)間: 2025-3-28 11:23
https://doi.org/10.1007/978-3-031-43770-0stribution of degrees), to practical (e.g.: improvements in crawling technology, uses in information retrieval, web spam prevention)..The goal of this talk is to convey an introduction to the state of the art in this area and to sketch the current issues in collecting, representing, analyzing, and modeling this graph.作者: 無意 時(shí)間: 2025-3-28 16:46
Andreas Kiesow,Tim Schomaker,Oliver Thomasracterized in[5]. For any other graph, its . is the maximum . for which it has a .-robust algorithm..We provide general lower bounds for robustness by improving a natural algorithm obtained from Menger’s Theorem. We determine robustness for several examples, such as complete graphs, grids, and hypercubes.作者: Prognosis 時(shí)間: 2025-3-28 20:39
Jan-Hendrik Heinen,Jens P?ppelbu? sampled graph. In particular we show that shortest path routed sampling allows a clear characterization of underlying graphs with scale-free topology. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in different network models.作者: adequate-intake 時(shí)間: 2025-3-28 23:47 作者: GET 時(shí)間: 2025-3-29 06:48
Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis sampled graph. In particular we show that shortest path routed sampling allows a clear characterization of underlying graphs with scale-free topology. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in different network models.作者: 填料 時(shí)間: 2025-3-29 07:16 作者: Basilar-Artery 時(shí)間: 2025-3-29 12:36 作者: 安裝 時(shí)間: 2025-3-29 16:37 作者: 獨(dú)特性 時(shí)間: 2025-3-29 22:37
Invited Talk: The Many Wonders of the Web Graphstribution of degrees), to practical (e.g.: improvements in crawling technology, uses in information retrieval, web spam prevention)..The goal of this talk is to convey an introduction to the state of the art in this area and to sketch the current issues in collecting, representing, analyzing, and modeling this graph.作者: 進(jìn)入 時(shí)間: 2025-3-30 00:43 作者: 欲望小妹 時(shí)間: 2025-3-30 04:55 作者: TOXIC 時(shí)間: 2025-3-30 09:48 作者: 排斥 時(shí)間: 2025-3-30 15:22 作者: TERRA 時(shí)間: 2025-3-30 17:30 作者: Fracture 時(shí)間: 2025-3-30 20:45 作者: Yag-Capsulotomy 時(shí)間: 2025-3-31 04:50
Jan-Hendrik Heinen,Jens P?ppelbu?n how scheduling algorithms for single switches can be modified in order to design scheduling algorithms that stabilize networks of input-queued switches. We apply those results to the design of the maximal weight matching algorithm proposed in this paper and show that the algorithm does not only st作者: 裝入膠囊 時(shí)間: 2025-3-31 08:20 作者: 賞心悅目 時(shí)間: 2025-3-31 10:19 作者: 輕觸 時(shí)間: 2025-3-31 13:44 作者: BLOT 時(shí)間: 2025-3-31 19:21 作者: Aggressive 時(shí)間: 2025-3-31 23:20
Aggregating Correlated Data in Sensor Networksion is geographically correlated, then a large saving in data transmission costs may be obtained by aggregating information from nearby nodes before sending it to the central agent. This is particularly relevant to sensor networks where battery limitations dictate that data transmission be kept to a作者: Dysplasia 時(shí)間: 2025-4-1 02:58 作者: 廢除 時(shí)間: 2025-4-1 08:53
Congestion Games, Load Balancing, and Price of Anarchys speed, but it grows linearly with (or, more generally, as the .th power of) the number of clients matched to it. Many emerging Internet-centric applications such as peer-to-peer networks, multi-player online games and distributed computing platforms exhibit such interaction of self-interested user作者: 保守 時(shí)間: 2025-4-1 12:35
Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectivesd . ≤ . represent the capacity constraints. We consider the class of . utility functions, consisting of functions . that are symmetric, non-decreasing, concave, and satisfy .(0) = 0. We present a single dual update subroutine that results in a primal solution which is a logarithmic approximation, si作者: 震驚 時(shí)間: 2025-4-1 16:44
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces link structure of existing nodes, and a certain number of additional random links are introduced. Our model parametrizes the number of random links, thereby allowing for the analysis of threshold behaviour. We consider infinite limits of graphs generated by our model, and compare properties of thes作者: 尖牙 時(shí)間: 2025-4-1 19:38
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routingard edges. This model is motivated by BGP routing policies of autonomous systems in the Internet. Robustness considerations lead to the problem of computing a maximum number of disjoint paths between two nodes, and the minimum size of a cut that separates them. We study these problems in the valley-作者: 得罪 時(shí)間: 2025-4-2 00:12
A Distributed Algorithm to Find Hamiltonian Cycles in , Random Graphs finds a Hamiltonian cycle in . with high probability when ., and terminates in linear worst-case number of pulses, and in expected .(..) pulses. The algorithm requires, in each node of the network, only .(.) space and .(.) internal instructions.
