Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Bundit Laekhanukit
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Non-Redistributive Second Welfare Theorems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Improved Hardness Results for Profit Maximization Pricing Problems With Unlimited Supply
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Secluded Path via Shortest Path
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Complexity of Min-Max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for the Shortest Superstring Problem.
An Algorithm of Searching for the Shortest Path
An Improved SPFA Algorithm for Single-Source Shortest Path Problem Using Forward Star Data Structure
International Journal of Managing Information Technology
A Novel Stackelberg-Bertrand Game Model for Pricing Content Provider
Shortest Path Refinement for HARP Motion Tracking
