93 search results - page 10 / 19 » Conditional hardness for approximate coloring |
SPAA
2003
ACM
14 years 21 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
PICS
2001
13 years 8 months ago
2001
In 1998, a Technical Committee 8-04 was formed in CIE/Division 8, "to investigate the state of adaptation of the visual system when comparing soft-copy images on selfluminous...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
ESANN
2004
13 years 8 months ago
2004
Abstract. In the context of nonlinear regression, we consider the problem of explaining a variable y from a vector x of explanatory variables and from a vector t of conditionning v...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...