120 search results - page 22 / 24 » FPT Algorithms for Connected Feedback Vertex Set |
147
Voted
ESA
2003
Springer
15 years 6 months 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 ...
101
Voted
ARSCOM
1998
15 years 23 days ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
135
Voted
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
112
Voted
CGF
2005
15 years 28 days ago
2005
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...
125
Voted
IPCO
2007
15 years 2 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...