Back to Results
First PageMeta Content
Theoretical computer science / Computational complexity theory / Relaxation / Linear programming / Approximation algorithm / Lagrangian relaxation / Duality / Spectral theory of ordinary differential equations / Euclidean algorithm / Mathematical optimization / Mathematical analysis / Convex optimization


On Lagrangian Relaxation and Subset Selection Problems (Extended Abstract) Ariel Kulik∗ Hadas Shachnai†
Add to Reading List

Document Date: 2008-06-23 10:33:06


Open Document

File Size: 184,82 KB

Share Result on Facebook

City

Haifa / /

Country

Israel / /

Currency

PEN / /

/

IndustryTerm

randomized approximation algorithm / real-time scheduling / search range / find solutions / approximation algorithm / feasible solution / binary search / polynomial time algorithm / approximate solution / fractional solution / above algorithm / approximate solutions / non-feasible solution / integral solution / feasible solutions / approximation algorithms / not require rounding a fractional solution / /

Organization

Technion V / Technion / /

Person

Ariel Kulik∗ Hadas Shachnai / /

ProvinceOrState

Wisconsin / /

TVStation

WIS / /

Technology

above algorithm / following algorithm / polynomial time algorithm / randomized approximation algorithm / approximation algorithm / 8 The algorithm / approximation algorithms / 5 3 Approximation Algorithms / deriving approximation algorithms / /

SocialTag