Sciweavers

Share
10 search results - page 1 / 2
» 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower...
Sort
View
TAPAS
2011
255views Algorithms» more  TAPAS 2011»
10 years 8 months ago
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
Iyad A. Kanj, Fenghui Zhang
IPL
2010
111views more  IPL 2010»
10 years 11 months ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
9 years 3 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
COLT
2005
Springer
11 years 6 months ago
Learning a Hidden Hypergraph
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
Dana Angluin, Jiang Chen
JGAA
2006
127views more  JGAA 2006»
11 years 1 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
books