540 search results - page 93 / 108 » New bounds on the edge number of a k-map graph |
CCCG
2008
13 years 9 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
ICWSM
2009
13 years 5 months ago
2009
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
TAMC
2010
Springer
14 years 20 days ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...