Sciweavers

4131 search results - page 151 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
127
Voted
ESA
2009
Springer
115views Algorithms» more  ESA 2009»
15 years 10 months ago
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
120
Voted
EUSFLAT
2009
105views Fuzzy Logic» more  EUSFLAT 2009»
15 years 1 months ago
Two Results About Optimization of Fuzzy Variable Functions
Abstract-- We discuss some optimization problems for fuzzy variable functions and show two interesting results. First result is related to conditions for existence of global optima...
A. David Báez-Sánchez
124
Voted
MICS
2010
124views more  MICS 2010»
14 years 10 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
148
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang
208
Voted
IWPEC
2010
Springer
15 years 1 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...