Back to Results
First PageMeta Content
NP-complete problems / Graph operations / Tree decomposition / Vertex cover / Minor / Planar graph / Dynamic programming / Path decomposition / Apex graph / Graph theory / Theoretical computer science / Mathematics


Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs
Add to Reading List

Document Date: 2013-11-08 11:23:34

Open Document

File Size: 263,54 KB

Share Result on Facebook

Company

Creative Commons / Vertex / S. LP / /

Country

Austria / United States / /

Facility

Georgia Institute of Technology / University of Vienna / University of Chicago / /

IndustryTerm

present approximation algorithms / polynomial time exact algorithms / near-optimal pricing solution / constant-factor approximation algorithm / approximation algorithm / linear time algorithm / approximate solution / cheapest products / α-approximation algorithm / dynamic programming algorithm / fractional solution / above solution / pre-processing / approximation algorithms / /

Organization

Department of Computer Science / Georgia Institute of Technology / University of Vienna / University of Chicago / Chicago / Nanyang Technological University / Academic Research Fund / Singapore Ministry of Education / /

Person

Shiva Kintali Richard / J. L IPTON / Shiva Kintali / Parinya Chalermsook / Richard J. Lipton Danupon Nanongkai / Richard J. Lipton / Danupon Nanongkai / /

Technology

α-approximation algorithm / constant-factor approximation algorithm / randomized algorithm / approximation algorithm / 4-approximation algorithm / present approximation algorithms / 4.2 Algorithm / approximation algorithms / 3-approximation algorithm / improved algorithm / dynamic programming algorithm / linear time algorithm / rounding algorithm / /

URL

http /

SocialTag