Sciweavers

Share
DAM
2006
132views more  DAM 2006»
8 years 7 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
DAM
2006
100views more  DAM 2006»
8 years 7 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
DAM
2006
59views more  DAM 2006»
8 years 7 months ago
Optimal strategies for equal-sum dice games
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, ) dice game, two players can independently choose a dice from a collection...
Bart De Schuymer, Hans De Meyer, Bernard De Baets
DAM
2006
71views more  DAM 2006»
8 years 7 months ago
Algorithms for clique-independent sets on subclasses of circular-arc graphs
Guillermo Durán, Min Chih Lin, Sergio Mera,...
DAM
2006
118views more  DAM 2006»
8 years 7 months ago
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization ...
Sebastián Urrutia, Celso C. Ribeiro
DAM
2006
191views more  DAM 2006»
8 years 7 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
DAM
2006
49views more  DAM 2006»
8 years 7 months ago
Two-tuple balance of non-binary sequences with ideal two-level autocorrelation
Let p be a prime, q = pm and Fq be the finite field with q elements. In this paper, we will consider q-ary sequences of period qn - 1 for q > 2 and study their various balance ...
Guang Gong, Hong-Yeop Song
DAM
2006
66views more  DAM 2006»
8 years 7 months ago
On the structure of the adjacency matrix of the line digraph of a regular digraph
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...
Simone Severini
DAM
2006
61views more  DAM 2006»
8 years 7 months ago
On error-tolerant DNA screening
Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outco...
Weili Wu, Yaochun Huang, Xiao Huang, Yingshu Li
books