Randomized Algorithms (Spring 2010)/Randomized approximation algorithms
From TCS Wiki
Revision as of 07:07, 27 May 2010 by
imported>WikiSysop
(
→Combinatorial approximation algorithms
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Contents
1
Approximation Algorithms
1.1
Coping with the NP-hardness
1.2
Combinatorial approximation algorithms
1.2.1
Scheduling
1.2.2
Knapsack
1.3
LP-based approximation algorithms
2
Randomized Rounding
2.1
The integrality gap
2.2
Randomized rounding
2.3
Max-SAT
2.4
Covering and Packing
Approximation Algorithms
Coping with the NP-hardness
Combinatorial approximation algorithms
Scheduling
Knapsack
LP-based approximation algorithms
Randomized Rounding
The integrality gap
Randomized rounding
Max-SAT
Covering and Packing
Navigation menu
Personal tools
Log in
Namespaces
Page
Discussion
English
Views
Read
View source
View history
More
Search
课程主页
首页
组合数学
随机算法
讨论班
近似算法讨论班
links
EtoneWiki
EddyWiki
Wikipedia
MathWorld
Nestia.com
Help
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information