Titlebook: Combinatorial Optimization and Applications; 5th International Co Weifan Wang,Xuding Zhu,Ding-Zhu Du Conference proceedings 2011 Springer-V

CLAIM

https://doi.org/10.1007/978-3-030-61033-3 when this online algorithm is compared with a clairvoyant algorithm achieving the best total value. In this paper, we study a simple and intuitive online algorithm. We analyze its performance in terms of competitive ratio for the general model and a few important variants.

向宇宙

Stories and Conversations in the Smart City, energy cost and access time into consideration to schedule the data retrieval process in multi-channel environments. It can be used in almost any broadcast environment, in which the data access frequencies, data sizes, and channel bandwidths can all be non-uniform.

Catheter

Harish Karnatak,Kamal Pandey,V. Raghavaswamyrational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.

Chameleon

輕而薄

Catherine Crago Blanton,Walt TrybulaG algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.

backdrop

Watemelon

偶然

A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unrerational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.

intertwine

Restricted Edge Connectivity of Harary Graphs,nduced by .. A graph . is called ..-optimal if ..(.)?=?..(.). A natural question is whether there exists a graph . which is ..-optimal for any .?≤?|.(.)|/2. In this paper, we show that except for two cases, the Harary graph has this property.

IVORY

Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless SensoG algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.