Sciweavers

613 search results - page 45 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
MDM
2009
Springer
125views Communications» more  MDM 2009»
14 years 2 months ago
Data Gathering by Mobile Mules in a Spatially Separated Wireless Sensor Network
While wireless sensor networks (WSNs) are typically targeted at large-scale deployment, due to many practical or inevitable reasons, a WSN may not always remain connected. In this...
Fang-Jing Wu, Chi-Fu Huang, Yu-Chee Tseng
ANTSW
2010
Springer
13 years 5 months ago
A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
Pablo Romero, Franco Robledo, Pablo Rodrígu...
ICUMT
2009
13 years 5 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 8 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 11 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...