Sciweavers

15254 search results - page 87 / 3051
» A k
Sort
View
FOCS
1993
IEEE
15 years 1 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
SWAT
1994
Springer
86views Algorithms» more  SWAT 1994»
15 years 1 months ago
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
Arvind Gupta, Naomi Nishimura
CIE
2007
Springer
15 years 1 months ago
K -Trivial Closed Sets and Continuous Functions
We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial 0 1 class with no...
George Barmpalias, Douglas A. Cenzer, Jeffrey B. R...
APPROX
2006
Springer
110views Algorithms» more  APPROX 2006»
15 years 1 months ago
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad ...
COCOON
2004
Springer
15 years 1 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu