224 search results - page 13 / 45 » G-graphs for the cage problem: a new upper bound |
132
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
173
click to vote
COMPGEOM
2008
ACM
15 years 7 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
152
click to vote
DAM
2008
15 years 6 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
149
click to vote
FCT
2007
Springer
16 years 7 days ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
151
click to vote
FOCS
2008
IEEE
16 years 16 days ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...