Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Link opens in a new tab
Search content at Ben-Gurion University Research Portal
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs
Almost optimal query algorithm for hitting set using a subset query
Arijit Bishnu
, Arijit Ghosh
, Sudeshna Kolay
, Gopinath Mishra
, Saket Saurabh
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Almost optimal query algorithm for hitting set using a subset query'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Hitting Set
100%
Almost Optimal
100%
Subset Queries
100%
Query Algorithm
100%
Optimal Query
100%
Query Oracle
100%
Oracle
80%
Hypergraph
40%
Hyperedge
40%
Query Complexity
40%
ISAAC
40%
Sublinear Algorithms
40%
Set Query
40%
Uniform Hypergraph
40%
Parameterized Queries
40%
Tight
20%
Number of Edges
20%
Disjoint
20%
Combinatorial Optimization
20%
K Parameter
20%
Hitting Set Problem
20%
Number of Triangles
20%
Query Model
20%
Mathematics
Hitting Set
100%
Hypergraphs
100%
Query Complexity
50%
Independent Set
50%
Upper Bound
25%
Edge
25%
Pairwise Disjoint
25%
Intersects
25%
Triangle
25%
Nonempty Subset
25%
Combinatorial Optimization
25%
Computer Science
Independent Set
100%
Hyperedges
100%
Parameterized Query
100%
Combinatorial Optimisation
50%
Fundamental Problem
50%
Nonempty Subset
50%