"Efficient solutions to relaxations of combinatorial problems with ..."

Fabián A. Chudak, Kiyohito Nagano (2007)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/ChudakN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChudakN07
Fabián A. Chudak, Kiyohito Nagano:
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. SODA 2007: 79-88

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.