"Solving and Approximating Combinatorial Optimization Problems (Towards MAX ..."

Jaroslav Nesetril, Daniel Turzík (1997)

> Home

Details and statistics

DOI: 10.1007/3-540-63774-5_98

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/NesetrilT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/NesetrilT97
Jaroslav Nesetril, Daniel Turzík:
Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP). SOFSEM 1997: 70-85

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.