Keyphrases
Approximation Algorithms
96%
Log-log
41%
IEEE Floating Point
36%
Local Optimality
27%
Packet Forwarding
27%
Online Algorithms
25%
Minimum Weight
25%
Competitive Ratio
24%
Number of Vertices
23%
Approximation Ratio
23%
Double Precision
22%
Undirected Graph
22%
Latency
22%
Floating-point Adder
21%
Retiming
21%
Codeword
20%
Improved Approximation
20%
Rounding Algorithm
20%
Approximation Factor
20%
Bounded Degree Graphs
19%
Logic Level
19%
Directed Graph
19%
Hypergraph
19%
Optimality Guarantee
18%
Software-defined Networking
18%
Steiner Problem
18%
Constant Time
18%
Tanner Codes
18%
Floating-point Addition
17%
Adder Design
17%
Floating-point Arithmetic
16%
Load Balancing Algorithm
15%
Microarchitecture
15%
Feedback Set
15%
2-approximation
15%
Vertex Weight
15%
Dictionary
15%
IEEE Rounding
14%
Feedback Vertex Set Problem
14%
Error Probability
14%
Linear Programming
14%
Frequency Assignment
13%
Path Computation
13%
Covering Algorithm
13%
Path Functions
13%
Function Placement
13%
Hitting Set
13%
Distributed Algorithms
13%
Extended Abstracts
13%
Edge-connectivity
13%
Computer Science
Approximation Algorithms
100%
Floating Point
54%
Approximation (Algorithm)
41%
Directed Graphs
34%
Approximation Ratio
27%
Local Optimality
27%
Competitive Ratio
26%
on-line algorithm
24%
Linear Programming
22%
Double Precision
22%
Distributed Algorithm
21%
Rounding Algorithm
20%
Logic Level
19%
Load Balancing
18%
Software-Defined Network
18%
Data Structure
18%
Microarchitecture
18%
approximation factor
18%
Clock Cycle
17%
Cardinality
17%
Floating Point Addition
17%
Link Capacity
15%
Multiplicity
15%
Subgraphs
14%
Primal-Dual
13%
Point Multiplication
13%
Constant Factor
13%
Network Function
13%
Single Precision
13%
And-States
13%
min-sum algorithm
12%
Computer Hardware
12%
Pipelining
11%
Connectivity Problem
10%
Network Design Problem
10%
Tanner Graph
10%
Cellular Network
10%
Message Passing
9%
Rounding Mode
9%
Boolean Network
9%
Graph Coloring
9%
Coloring Problem
9%
Allocation Problem
9%
Virtual Networks
9%
Online Approach
9%
Service Model
9%
Random Access
9%
Virtual Circuit
9%
Random Graphs
9%
Interconnection Network
9%
Mathematics
Edge
77%
Probability Theory
51%
Running Time
34%
Upper Bound
28%
Rounding
27%
Approximates
27%
Linear Programming
26%
Intersects
24%
Polynomial Time
22%
Constant Time
18%
Graph Model
17%
Minimizes
16%
Cardinality
16%
Memoryless
15%
Hypergraphs
15%
Subset Size
14%
Hitting Set
13%
Optimality
13%
Edge-Connectivity
13%
Greedy Algorithm
13%
Constant Factor
13%
Approximate Solution
13%
Polynomial
13%
Worst Case
13%
weighted graph
12%
Concludes
12%
Random Variable
12%
Competitive Ratio
12%
Maximum Degree
11%
Embedding Problem
11%
Communicates
11%
Divide and Conquer
11%
Connected Graph
11%
Open Problem
11%
Integer
10%
Multiset
10%
Constant Ratio
9%
Hexagon
9%
Covering Problem
9%
Fixed Costs
9%
Parametric
9%
Time Window
9%
Graph Partition
9%
Error Analysis
9%
Dimensional Case
9%
Aspect-Ratio
9%
Horizontal Line
9%
Vertical Line
9%
Single Copy
9%
Random Graphs
9%
