3475 search results - page 375 / 695 » Backbones in Optimization and Approximation |
184
click to vote
ECRTS
2006
IEEE
16 years 22 days ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
198
click to vote
AAIM
2006
Springer
16 years 20 days ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
187
click to vote
ACSC
2005
IEEE
16 years 9 days ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
174
click to vote
COCOON
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
180
click to vote
ESA
2005
Springer
16 years 6 days ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...