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
2-approximation
11%
Approximation Algorithms
33%
Approximation Guarantee
22%
Approximation Ratio
11%
Augmentation Problem
11%
Combinatorial Algorithms
11%
Covering Problem
66%
Degree Densities
11%
Edge Cover
100%
Exact Solutions
11%
Fixed Costs
55%
Hardness Results
11%
Inapproximability
11%
Integrality Gap
11%
Linear Programming
11%
Maximum Weight
11%
NP-hard
11%
NP-hardness
11%
Number of Edges
22%
Set Expansion
100%
Simple Undirected Graph
11%
Small-set Expansion
100%
Tight
11%
Total Weight
11%
Undirected Graph
11%
Vertex Weight
11%
Vertex-weighted Graph
11%
Mathematics
Combinatorial Algorithm
11%
Edge
33%
Edge Cover
100%
Fixed Costs
55%
Integral Vertex
11%
Linear Program
11%
Simple Graph
11%
Small Set
100%
Total Weight
11%
weighted graph
11%