4 search results - page 1 / 1 » Paired Approximation Problems and Incompatible Inapproximabi... |
SODA
2010
ACM
15 years 9 months ago
2010
ACM
ICTCS
2005
Springer
15 years 5 months ago
2005
Springer
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
140
click to vote
ECCC
2007
14 years 11 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
145
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...