Sciweavers

7840 search results - page 134 / 1568
» On generalized Ramsey numbers
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 5 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
David R. Wood
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
14 years 8 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...
WG
2009
Springer
14 years 5 months ago
Exact and Parameterized Algorithms for Max Internal Spanning Tree
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
Henning Fernau, Serge Gaspers, Daniel Raible
SIGMETRICS
2006
ACM
116views Hardware» more  SIGMETRICS 2006»
14 years 4 months ago
The Erlang model with non-poisson call arrivals
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it ...
Thomas Bonald
STACS
2009
Springer
14 years 3 months ago
An Order on Sets of Tilings Corresponding to an Order on Languages
Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings...
Nathalie Aubrun, Mathieu Sablik