2283 search results - page 289 / 457 » Bounds of Graph Characteristics |
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
AI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...