187 search results - page 13 / 38 » Improved Approximation of MAX-CUT on Graphs of Bounded Degre... |
165
click to vote
WDAG
2000
Springer
15 years 9 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
170
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
209
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
149
click to vote
JMLR
2010
15 years 25 days ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
173
click to vote
AINA
2007
IEEE
16 years 12 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...