Skip to content
conftrace
_
Papers
Trends
Conferences
Explore
More
Authors
Topics
Keywords
Insights
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Insights
Achievements
Home
›
Keywords
›
fully polynomial time approximation scheme
fully polynomial time approximation scheme
2 papers
Explore in graph
Also known as
FPTAS
Co-occurring keywords
· papers mentioning both
resource graph game
(1)
parameterized complexity
(1)
congestion game
(1)
network design
(1)
river network
(1)
bidirected tree
(1)
security game
(1)
approximation algorithm
(1)
dynamic programming
(1)
nash equilibrium
(1)
Papers
An FPTAS for Computing Nash Equilibrium in Resource Graph Games
IJCAI 2018
Stochastic Network Design in Bidirected Trees
NeurIPS 2014
<
1
>