CORR
2002
Springer
13 years 10 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
ALGORITHMICA
2004
13 years 10 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
4OR
2004
13 years 10 months ago
2004
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
CGF
2005
13 years 10 months ago
2005
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive....
JCT
2007
13 years 10 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
JC
2007
13 years 10 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
TIT
2008
13 years 10 months ago
2008
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and...
SIAMDM
2008
13 years 10 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
GC
2007
Springer
13 years 10 months ago
2007
Springer
We determine lower and upper bounds for the size of a hyperplane of the dual polar space DW(5, q). In some cases, we also determine all hyperplanes attaining these bounds.
DAM
2007
13 years 10 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...