22 search results - page 2 / 5 » Improved Inapproximability Results for Maximum k-Colorable S... |
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
GLOBECOM
2008
IEEE
13 years 4 months ago
2008
IEEE
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...