7129 search results - page 564 / 1426 » Approximation Algorithms for Treewidth |
201
click to vote
CIA
2008
Springer
15 years 9 months ago
2008
Springer
This paper presents a specific contracting algorithm that contributes to the process of distributed planning and resource allocation in competitive, semi-trusted environments. The ...
193
Voted
ALGORITHMICA
2008
15 years 7 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
194
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
210
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
180
click to vote
INFOCOM
2003
IEEE
16 years 23 days ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...