3341 search results - page 232 / 669 » On Bounded Queries and Approximation |
167
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
231
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
229
click to vote
AAIM
2007
Springer
16 years 1 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
192
click to vote
PODC
2005
ACM
16 years 22 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
211
click to vote
ESA
2005
Springer
16 years 21 days ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...