500 search results - page 38 / 100 » Approximation algorithms for maximum independent set of pseu... |
123
Voted
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Perceptual image quality assessment (IQA) and sparse signal representation have recently emerged as high-impact research topics in the field of image processing. Here we make one...
127
click to vote
SIAMCOMP
2000
15 years 1 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
90
Voted
DM
2008
15 years 1 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...