Binary Signal Alignment: Optimal Solution is Polynomial-Time and Linear-Time Solution is Quasi-Optimal.
Spyridon PeppasNicholas D. SidiropoulosPublished in: ICASSP (2024)
Keyphrases
- optimal solution
- finding the optimal solution
- worst case
- np hard
- solution quality
- global optimum
- obtain the optimal solution
- objective function
- branch and bound
- metaheuristic
- lower bound
- search space
- greedy heuristic
- feasible solution
- branch and bound algorithm
- solution space
- signal processing
- locally optimal
- high frequency
- iterative procedure
- special case
- linear programming
- knapsack problem
- linear program
- total cost
- suboptimal solutions
- approximation algorithms
- min sum
- upper bound
- closed form
- non stationary
- frequency domain
- linear programming problems
- pareto optimal
- initial solution
- approximate solutions
- column generation
- scheduling problem
- multi objective