"Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted ..."

Dimitris Fotakis et al. (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2020.50

access: open

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/icalp/FotakisKLMPS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/FotakisKLMPS20
Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis:
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. ICALP 2020: 50:1-50:19

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.