Sciweavers

Share
CORR
2002
Springer
102views Education» more  CORR 2002»
9 years 1 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
9 years 1 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
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...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
4OR
2004
99views more  4OR 2004»
9 years 1 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
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 ...
Thierry Benoist, Benoît Rottembourg
CGF
2005
133views more  CGF 2005»
9 years 1 months ago
Constrained Visualization Using the Shepard Interpolation Family
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....
Ken W. Brodlie, Muhammed Rafiq Asim, Keith Unswort...
JCT
2007
146views more  JCT 2007»
9 years 1 months ago
Laplacian spectral bounds for clique and independence numbers of graphs
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...
Mei Lu, Huiqing Liu, Feng Tian
JC
2007
94views more  JC 2007»
9 years 1 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
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...
A. Papageorgiou
TIT
2008
84views more  TIT 2008»
9 years 1 months ago
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds
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...
Christine Bachoc, Yael Ben-Haim, Simon Litsyn
SIAMDM
2008
123views more  SIAMDM 2008»
9 years 1 months ago
Adapted List Coloring of Graphs and Hypergraphs
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...
Alexandr V. Kostochka, Xuding Zhu
GC
2007
Springer
9 years 1 months ago
On Small and Large Hyperplanes of DW (5, q )
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.
Bart De Bruyn, Harm Pralle
DAM
2007
70views more  DAM 2007»
9 years 1 months ago
Path-kipas Ramsey numbers
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 ...
A. N. M. Salman, H. J. Broersma
books