523 search results - page 23 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
111
click to vote
DIALM
2008
ACM
15 years 4 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
117
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
104
click to vote
STOC
1995
ACM
15 years 5 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
126
Voted
NETWORKS
2006
15 years 2 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
154
Voted
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...