42230 search results - page 92 / 8446 » Algorithms and Complexity Results for |
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
168
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
DATAMINE
2007
14 years 9 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...