214 search results - page 23 / 43 » The node capacitated graph partitioning problem: A computati... |
115
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
106
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
106
Voted
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
91
Voted
TCS
2008
15 years 1 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
103
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...