Local approximation for maximum H0-free partial subgraph problems
Date
2003Link to item file
https://hal.archives-ouvertes.fr/hal-00003926Dewey
Programmation, logiciels, organisation des donnéesSujet
Hereditary property; APX-complete; Maximum subgraph problem; Minimum vertex deletion problem; Aproximation algorithms; Local searchJournal issue
Operations Research LetterVolume
31Number
3Publication date
2003Article pages
195-201Collections
Metadata
Show full item recordAuthor
Monnot, Jérôme
Paschos, Vangelis
Toulouse, S.