1554 search results - page 135 / 311 » Parameterized Complexity and Approximation Algorithms |
237
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
172
Voted
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
123
Voted
SISAP
2008
IEEE
15 years 10 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
152
Voted
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
125
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...