3875 search results - page 69 / 775 » Approximation Algorithms for the Max-coloring Problem |
SIGCOMM
2010
ACM
13 years 9 months ago
2010
ACM
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
CPM
1998
Springer
14 years 1 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
INFOCOM
2011
IEEE
13 years 16 days ago
2011
IEEE
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
AAAI
2008
13 years 11 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...