2421 search results - page 17 / 485 » Approximate Flow-Aware Networking |
107
click to vote
OL
2010
14 years 4 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
ALGORITHMICA
1999
14 years 9 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
PVLDB
2010
14 years 8 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...