20 search results - page 4 / 4 » Improvement on vertex cover for low-degree graphs |
ACSC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
APPROX
2008
Springer
13 years 9 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...
ESA
2003
Springer
14 years 20 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ANOR
2005
13 years 7 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
ISAAC
2005
Springer
14 years 29 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...