"Approximating the Vertex Cover Problem by Selection of Nodes of Maximum ..."

Charlie Obimbo (2008)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2009-02-11

- no documents available
- export record
  dblp key:
  - conf/fcs/Obimbo08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fcs/Obimbo08
Charlie Obimbo:
Approximating the Vertex Cover Problem by Selection of Nodes of Maximum Degrees for use in Wireless Sensor Networks. FCS 2008: 256-259

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.