"Approximation Algorithms for Finding a Maximum-Weight Spanning Connected ..."

Alexey Baburin, Edward Gimadi (2004)

> Home

Details and statistics

DOI: 10.1007/3-540-27679-3_43

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/or/BaburinG04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/or/BaburinG04
Alexey Baburin, Edward Gimadi:
Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. OR 2004: 343-351

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.