10 search results - page 2 / 2 » Distributed Weighted Vertex Cover via Maximal Matchings |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— In a fading broadcast channel (BC), Queue Proportional Scheduling (QPS) is presented via geometric programming (GP). Given the current queue state, QPS allocates a data...
JGAA
2000
13 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
TWC
2008
13 years 5 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...