Back to Results
First PageMeta Content
NP-complete problems / Combinatorial optimization / Operations research / Approximation algorithms / Linear programming relaxation / Generalized assignment problem / APX / Knapsack problem / Dominating set / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2005-12-20 11:13:05

Open Document

File Size: 182,41 KB

Share Result on Facebook

Company

IBM / AAP / Lagrangian LP / Ii Let LP / GAP / Regis / /

Currency

pence / /

/

IndustryTerm

βapproximate separation algorithm / local search algorithm / similar local search algorithm / natural local search algorithm / parallel algorithms / cellular networks / service provider cellular networks / arbitrary networks / approximation algorithm / good approximate solution / ad-hoc networks / 32n search / local search / canexact algorithm / local search problem / above local search / polynomial-time algorithm / polynomial-time local search / above algorithm / improved approximation algorithm / separation algorithm / search algorithm / local optimal solution / empty solution / approximation algorithms / βapproximation polynomial-time algorithm / above local search algorithm / constant-factor approximation algorithm / polynomial-time exact algorithm / feasible solution / approximate separation algorithm / greedy algorithm / naive algorithm / approximate solution / local search problems / β-approximate local solution / reduction approximation algorithm / simpler algorithms / β-approximation algorithm / others tion algorithm / fractional solution / β-approximate separation algorithm / asapproximation algorithm / feasible solutions / /

Organization

National Science Foundation / MIT / MIT Department of Mathematics / /

Person

Li Li / Ai / R. Garg / V / Raphael Yuster / L. Li / V / M. Goemans / V / Chandra Chekuri / Michel X. Goemans† Vahab / /

Position

player / Maximum General / Fisher / /

Product

Nash equilibria8 / /

ProgrammingLanguage

Hoc / /

PublishedMedium

Journal of the ACM / SIAM journal on Computing / Theory of Computing / /

Technology

E. algorithms / local search algorithm / above local search algorithm / above algorithm / constant-factor approximation algorithm / LP algorithm / β-approximate separation algorithm / 0.31-approximation algorithm / search algorithm / canexact algorithm / approximate separation algorithm / similar local search algorithm / Sequential and parallel algorithms / 1 algorithm / 0.63-approximation algorithm / separation algorithm / reduction approximation algorithm / 3/4approximation algorithms / others tion algorithm / β-approximation algorithm / natural local search algorithm / 2 LP-Based Approximation Algorithms / LP-based algorithm / βapproximate separation algorithm / maximizing asapproximation algorithm / approximation algorithm / polynomial-time algorithm / greedy algorithm / Tight Approximation Algorithms / naive algorithm / approximation algorithms / improved approximation algorithm / caching / 3 Local Search Algorithms / LP-rounding 2-approximation algorithm / βapproximation polynomial-time algorithm / /

SocialTag