Keyphrases
Polynomial Time
43%
Fast Algorithm
37%
Planar Graph
32%
Valuation Function
32%
NP-hard
32%
Maximum Weight Matching
28%
Plane Geometry
24%
Optimization Problem
24%
Apollonius
24%
Purchase Cost
24%
Apollonius Problem
24%
Geometry Optimization
24%
Production Location
24%
Euclidean Plane
24%
Total Travel Cost
24%
Production Facilities
24%
Traveling Salesman Problem
24%
Autonomous Systems
24%
Allocation Rules
24%
Optimal Algorithm
24%
Multidimensional Environment
24%
Budgeted Matroid Intersection
24%
Adjacency Relation
24%
Polynomial-time Approximation Scheme
24%
Budgeted Matching
24%
Matroid Intersection
24%
Gasoline
24%
Feasible Solution Set
24%
Matching Weights
24%
Maximum Weight
24%
Combinatorial Puzzles
24%
Lagrangian Relaxation
24%
Near-optimal Solution
24%
Combinatorial Optimization Problem
24%
Combinatorial Structure
24%
Polytope
24%
Budget Constraint
24%
Dynamic Programming
20%
Smoothed Analysis
15%
Hardness Results
15%
Minimum number
15%
Polynomial-time Algorithm
14%
Continuous Valuation
14%
Fully Polynomial Time Approximation Scheme
13%
Pricing Strategy
12%
Delay-sensitive Traffic
12%
Dynamic Flow
12%
Flow Migration
12%
Software-defined Networking
12%
Disk-shaped
12%
INIS
algorithms
100%
graphs
62%
solutions
48%
polynomials
37%
space
35%
approximations
30%
budgets
29%
cost
29%
hardness
29%
geometry
27%
tsp
24%
gasoline
24%
allocations
24%
demand
24%
environment
24%
prices
24%
constraints
23%
dynamics
23%
applications
22%
optimization
20%
routing
18%
trade
18%
internet
18%
implementation
17%
values
16%
decomposition
15%
travel
15%
length
15%
cities
13%
vectors
13%
assignments
12%
railways
12%
compatibility
12%
euclidean space
12%
simulation
12%
height
12%
calculation methods
12%
design
12%
speed
12%
norm
12%
computer codes
12%
units
12%
production
12%
trajectories
12%
resources
12%
migration
12%
incentives
12%
one-dimensional calculations
12%
management
12%
performance
12%
Mathematics
Polynomial Time
57%
Planar Graph
37%
Finite Set
30%
Circle
24%
Traveling Salesperson Problem
24%
Convex Subset
24%
Nonlinear Function
24%
Approximability
18%
Running Time
16%
Euclidean Plane Geometry
12%
Linear Programming
12%
Budget Constraint
12%
Bipartite Graph
12%
Image Recognition
12%
Optimal Assignment
12%
Fast Algorithm
12%
Optimal Trajectory
12%
Nonuniform
12%
Incentive compatibility
12%
Polytope
12%
Adjacency
12%
Combinatorial Structure
12%
Feasible Solution
12%
Considered Problem
12%
Combinatorial Optimization Problem
12%
Convex Domain
12%
Target Market
12%
Competitive Ratio
12%
Integrability Condition
12%
Matching Problem
12%
Worst Case
12%
Edge
8%
Exponential Time
6%
Convex Function
6%
Connected Component
6%
Choice Function
6%
Interval Graph
6%
Local Search
6%
Concludes
6%
Search Algorithm
6%
Polynomial
6%
Dominant Strategy
6%
Narrow Range
6%
Centroid
6%
Total Length
6%
Spanning Tree
6%
Periodic Time
6%
Asymmetric
6%
Complexity Space
6%
Convex Set
6%
