500 search results - page 29 / 100 » Approximation algorithms for maximum independent set of pseu... |
COMGEO
2010
ACM
15 years 1 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
124
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
151
Voted
CSDA
2011
14 years 8 months ago
2011
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...
144
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
96
Voted
JAL
2002
15 years 1 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...