1272 search results - page 25 / 255 » The Set Cover with Pairs Problem |
TCS
2008
15 years 17 days ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
81
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
115
click to vote
XPU
2010
Springer
14 years 11 months ago
2010
Springer
Pair Programming has often been reported to be beneficial in software projects. To better understand where these benefits come from we evaluate the aspect of intra-pair communica...
125
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
159
click to vote
ICALP
2011
Springer
14 years 4 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 ...