237 search results - page 9 / 48 » Improved Approximations of Independent Sets in Bounded-Degre... |
109
click to vote
WABI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
102
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
FCT
2007
Springer
15 years 5 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
119
click to vote
SPAA
2010
ACM
15 years 4 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...
112
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...