4843 search results - page 576 / 969 » The Shortcut Problem - Complexity and Approximation |
205
click to vote
ICALP
2011
Springer
14 years 8 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 ...
172
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
119
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
150
click to vote
RECOMB
2008
Springer
16 years 5 months ago
2008
Springer
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
175
click to vote
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper discusses how preference information of the decision maker can in general be integrated into multiobjective search. The main idea is to first define the opti...