We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...