"The optimality of the online greedy algorithm in carpool and chairman ..."

Don Coppersmith et al. (2011)

> Home

Details and statistics

DOI: 10.1145/1978782.1978792

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/CoppersmithNPTW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/CoppersmithNPTW11
Don Coppersmith, Tomasz Nowicki, Giuseppe Paleologo, Charles Philippe Tresser, Chai Wah Wu:
The optimality of the online greedy algorithm in carpool and chairman assignment problems. ACM Trans. Algorithms 7(3): 37:1-37:22 (2011)

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.