1933 search results - page 25 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
IPCO
2007
13 years 10 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
ESA
2003
Springer
14 years 1 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 ...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
CONSTRAINTS
2007
13 years 8 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...