Sciweavers

284 search results - page 8 / 57
» On Some Polyhedra Covering Problems
Sort
View
DAM
1999
119views more  DAM 1999»
13 years 8 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 9 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
14 years 16 days ago
Tight Results on Minimum Entropy Set Cover
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
DAM
2006
63views more  DAM 2006»
13 years 8 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
HCI
2007
13 years 10 months ago
On Some Aspects of Improving Mobile Applications for the Elderly
Improving the quality of life of elderly people is an emerging issue within our information society for both research and development. This paper addresses some issues on the devel...
Andreas Holzinger, Gig Searle, Alexander K. Nische...