1963 search results - page 87 / 393 » The Maximum Solution Problem on Graphs |
ALGORITHMICA
2006
13 years 10 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
DM
1999
13 years 9 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
GLOBECOM
2009
IEEE
14 years 4 months ago
2009
IEEE
— There is an ever increasing need for storing data in smaller and smaller form factors driven by the ubiquitous use and increased demands of consumer electronics. A new approach...
IWPEC
2010
Springer
13 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...