Keyphrases
2-approximation
17%
2-edge-connected
8%
Adversary
21%
Algorithm Efficiency
8%
Anonymity
9%
Anonymization
10%
Approximation Algorithms
100%
Approximation Guarantee
15%
Approximation Ratio
55%
Assembly Line
16%
Augmentation Problem
8%
Collaborative Filtering
7%
Combinatorial Auctions
12%
Computational Model
8%
Computer Science
45%
Computer Science Course
7%
Computer Science Education
8%
Computer Science Teacher Preparation
8%
Computer Science Teachers
8%
Connected Graph
10%
Connected Subgraphs
8%
Connection Problem
32%
Connectivity Augmentation
9%
Connectivity Augmentation Problem
18%
Convolutional Neural Network
10%
Covering Problem
10%
Degree Constrained
9%
Deterministic Algorithm
7%
Directed Graph
18%
Disjoint
11%
Distributed Algorithms
8%
Distributed Symmetry Breaking
7%
Domain Specific Aspect Languages
9%
Domain-specific Languages
7%
Dominant Strategy
8%
Edge Coloring
9%
Edge Cover
10%
Edge Set
18%
Edge-connectivity
12%
Exponential Weights
9%
Face Recognition
16%
Fault-tolerant
8%
Flash Memory
7%
General Graphs
13%
Graph Problems
16%
Hebrew
9%
High School
11%
High School Computer Science
7%
Improved Approximation
16%
Incentive Mechanism
12%
Index Coding
10%
Israel
41%
Israeli
16%
Java
8%
K-anonymity
10%
K-connected
25%
K-connected Graph
10%
K-edge
10%
Language Workbench
7%
Log-log
9%
LP Relaxation
7%
Makespan
7%
Matroid
9%
Metric Space
19%
Minimum Cost
25%
Minimum number
9%
Minimum Power
21%
Minimum Size
9%
Modularity
8%
Monotone
7%
Multi-sided Markets
8%
Network Coding
21%
Network Design Problem
13%
Network Problems
10%
Neural Network
7%
Neuromorphic
19%
Node Connectivity
26%
NP-hard
9%
NP-hard Problem
7%
Open University
24%
Orthogonal Polynomials
16%
Orthonormal Polynomials
8%
Polynomial Time
8%
Polynomial-time Algorithm
11%
Privacy-preserving
21%
Programmer
7%
Recommender Systems
9%
Spiking Neural Networks
12%
Steiner Forest
8%
Steiner System
11%
Steiner Tree
10%
Submodular Maximization
16%
Survivable Network Design Problem
9%
Survivable Networks
16%
Tight
15%
Tree Augmentation
11%
Undirected Graph
23%
Universality Limits
11%
Wireless Networks
13%
Wireless Sensor Networks
8%
Computer Science
Access Structure
7%
Action Recognition
6%
Adversarial Jammer
8%
Annotation
6%
Anonymity
10%
Anonymization
13%
Approximation (Algorithm)
67%
Approximation Algorithms
93%
Approximation Ratio
59%
approximation scheme
5%
Aspect-Oriented
6%
Aspect-Oriented Programming
5%
Case Study
8%
Clustering Algorithm
6%
Collaborative Filtering
9%
Coloring Problem
10%
Communication Network
6%
Competitive Ratio
5%
Computational Complexity
5%
Computational Modeling
11%
Computer Hardware
6%
Computer Science
45%
Computer Vision
9%
Connected Subgraph
21%
Connectivity Node
19%
Connectivity Problem
30%
Constant Factor
6%
Constraint Optimization Problems
6%
Convolutional Neural Network
9%
Data Mining
5%
Data Structure
19%
Deep Learning Method
8%
Degree Constraint
5%
Directed Graphs
37%
Distributed Algorithm
9%
Distributed Computing
9%
Distributed Network
6%
Domain-specific languages
9%
Efficient Algorithm
7%
Electronic Learning
8%
Experimental Result
5%
Face Recognition
20%
Fault Tolerant
9%
Flash Memory
6%
Fundamental Problem
8%
Greedy Algorithm
6%
Independent Set
6%
k-Nearest Neighbors Algorithm
5%
Learning System
6%
Location Problem
5%
Machine Learning
6%
Maximal Independent Set
6%
Maximal Matching
7%
Mechanism Design
5%
Message Passing
10%
Metric Space
8%
Morphological Analysis
5%
Network Capacity
6%
Network Coding
25%
Network Design
10%
Network Design Problem
24%
Network Lifetime
5%
Network Traffic
5%
Neural Network
12%
Obfuscation
6%
Parsing
9%
Polynomial Algorithm
5%
Polynomial Time
18%
Polynomial Time Algorithm
5%
Positive Integer
5%
Primal-Dual
5%
Privacy Preservation
5%
Privacy Preserving
23%
Project Scheduling
6%
Recommender Systems
8%
Representation Learning
5%
Scale-Invariant Feature Transform
6%
Secondary Schools
14%
Secret Sharing
12%
Social Network
8%
Source Codes
5%
steiner tree
6%
Subgraphs
46%
Syntactics
8%
Target Function
5%
Time Complexity
5%
Training Data
5%
Web Application
5%
Wireless Networks
16%
Wireless Sensor Network
5%