A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection.

Kyle Fox Philip N. Klein Shay Mozes

Published in: CoRR (2015)

Keyphrases

bicriteria
polynomial time approximation
approximation algorithms
efficient solutions
integer linear programming
approximation ratio
special case
flowshop
knapsack problem
np hard
random walk
shortest path problem
greedy algorithm
worst case
neural network
graphical models
lower bound
genetic algorithm