1949 search results - page 267 / 390 » Random graphs on surfaces |
152
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
155
Voted
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
127
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
144
Voted
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
126
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...