2079 search results - page 352 / 416 » Universality of random graphs |
138
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
156
click to vote
WIOPT
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
130
click to vote
BROADNETS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
145
click to vote
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
132
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...