SODA
1993
ACM
13 years 6 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...