"On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in ..."

Erin Wolf Chambers, Salman Parsa, Hannah Schreiber (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2022.25

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/compgeom/ChambersPS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/ChambersPS22
Erin Wolf Chambers, Salman Parsa, Hannah Schreiber:
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. SoCG 2022: 25:1-25:15

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.