2137 search results - page 107 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
124
Voted
ALENEX
2009
15 years 6 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
135
Voted
SWAT
1994
Springer
15 years 9 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
190
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
141
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
127
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...