Sciweavers

12519 search results - page 136 / 2504
» Approximation Problems Categories
Sort
View
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
16 years 14 days ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha
CVPR
2011
IEEE
15 years 1 months ago
Discriminative Image Warping with Attribute Flow
We address the problem of finding deformation between two images for the purpose of recognizing objects. The challenge is that discriminative features are often transformation-va...
Weiyu Zhang, Praveen Srinivasan, Jianbo Shi
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
15 years 10 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 6 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
AAAI
2008
15 years 8 months ago
Approximability of Manipulating Elections
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...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...