Sciweavers

867 search results - page 18 / 174
» The Generalized Maximum Coverage Problem
Sort
View
CATS
2006
13 years 9 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
COMSWARE
2006
IEEE
14 years 2 months ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
ICDCS
2010
IEEE
14 years 3 days ago
Analyzing Self-Defense Investments in Internet Security under Cyber-Insurance Coverage
—Internet users such as individuals and organizations are subject to different types of epidemic risks such as worms, viruses, and botnets. To reduce the probability of risk, an ...
Ranjan Pal, Leana Golubchik
COCOON
2008
Springer
13 years 10 months ago
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
Xianchao Zhang, Weifa Liang, Guoliang Chen
DAM
2011
13 years 3 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz