Keyphrases
NP-hard
100%
Polynomial Time
100%
Budget Constraint
100%
Near-optimal Solution
100%
Gasoline
100%
Polytope
100%
Combinatorial Structure
100%
Combinatorial Optimization Problem
100%
Lagrangian Relaxation
100%
Maximum Weight Matching
100%
Matching Weights
100%
Maximum Weight
100%
Combinatorial Puzzles
100%
Matroid Intersection
100%
Feasible Solution Set
100%
Adjacency Relation
100%
Budgeted Matroid Intersection
100%
Budgeted Matching
100%
Polynomial-time Approximation Scheme
100%
Computer Science
Polynomial Time
100%
Combinatorial Optimization Problem
50%
Lagrangian Relaxation
50%
Adjacency Relation
50%
Time Approximation Scheme
50%
Feasible Solution
50%
Maximum Weight Matching
50%
Budget Constraint
50%
Considered Problem
50%
Mathematics
Polynomial Time
100%
Budget Constraint
50%
Polytope
50%
Combinatorial Structure
50%
Adjacency
50%
Considered Problem
50%
Feasible Solution
50%
Combinatorial Optimization Problem
50%
INIS
solutions
100%
gasoline
100%
weight
40%
constraints
40%
polynomials
40%
optimization
20%
relaxation
20%
budgets
20%
approximations
20%
lagrangian
20%