1040 search results - page 88 / 208 » Rounding algorithms for covering problems |
COLT
2006
Springer
15 years 1 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
JPDC
2008
14 years 9 months ago
2008
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
ICDCS
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...