Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
On set expansion problems and the small set expansion conjecture
Rajiv Gandhi, Guy Kortsarz
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On set expansion problems and the small set expansion conjecture'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Edge Cover
100%
Small-set Expansion
100%
Set Expansion
100%
Covering Problem
66%
Fixed Costs
55%
Approximation Algorithms
33%
Number of Edges
22%
Approximation Guarantee
22%
Tight
11%
Undirected Graph
11%
2-approximation
11%
Integrality Gap
11%
Approximation Ratio
11%
Combinatorial Algorithms
11%
Linear Programming
11%
NP-hard
11%
Hardness Results
11%
Augmentation Problem
11%
Inapproximability
11%
Maximum Weight
11%
Total Weight
11%
NP-hardness
11%
Degree Densities
11%
Simple Undirected Graph
11%
Vertex-weighted Graph
11%
Exact Solutions
11%
Vertex Weight
11%
Mathematics
Small Set
100%
Edge Cover
100%
Fixed Costs
55%
Edge
33%
weighted graph
11%
Combinatorial Algorithm
11%
Linear Program
11%
Total Weight
11%
Simple Graph
11%
Integral Vertex
11%