Adding isolated vertices makes some greedy online algorithms optimal

An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with “enough” isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algo...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 246; pp. 12 - 21
Main Authors Boyar, Joan, Kudahl, Christian
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 10.09.2018
Elsevier BV
Subjects
Algorithms
Applied mathematics
Graphs
Greedy algorithm
Greedy algorithms
Isolated vertices
Online algorithms
Online independence number
Optimization
Greedy algorithm
Online algorithms
Online independence number
Isolated vertices
Online AccessGet full text
ISSN0166-218X
1872-6771
DOI10.1016/j.dam.2017.02.025

Cover

Abstract An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with “enough” isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs with at least one isolated vertex. These algorithms are not online optimal in general. The online optimality results for these greedy algorithms imply optimality according to various worst case performance measures, such as the competitive ratio. It is also shown that, despite this worst case optimality, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm. It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.
AbstractList An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with “enough” isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs with at least one isolated vertex. These algorithms are not online optimal in general. The online optimality results for these greedy algorithms imply optimality according to various worst case performance measures, such as the competitive ratio. It is also shown that, despite this worst case optimality, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm. It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.
An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with “enough” isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs with at least one isolated vertex. These algorithms are not online optimal in general. The online optimality results for these greedy algorithms imply optimality according to various worst case performance measures, such as the competitive ratio. It is also shown that, despite this worst case optimality, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm. It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.
Author Boyar, Joan
Kudahl, Christian
Author_xml – sequence: 1
  givenname: Joan
  orcidid: 0000-0002-0725-8341
  surname: Boyar
  fullname: Boyar, Joan
  email: joan@imada.sdu.dk
– sequence: 2
  givenname: Christian
  surname: Kudahl
  fullname: Kudahl, Christian
  email: kudahl@gmail.com
BookMark eNp9kE1rwzAMhs3oYG23H7BbYOdkdhLHLjuV7hMKu2ywm3FsuXOWxJ3tFvrv59KddpgQEoL3kdA7Q5PRjYDQNcEFwaS57Qoth6LEhBW4TEnP0JRwVuYNY2SCpknT5CXhHxdoFkKHMSZpmqL7pdZ23GQ2uF5G0NkefLQKQjbIr1SDGyDbeAB9yNzY2xEy2W-ct_FzCJnbRjvI_hKdG9kHuPrtc_T--PC2es7Xr08vq-U6V1VJY25aXBlMSVunKBnDLWsWpqI1l7XmrWmNpkDrirOGVYYwzblipqklp7pR2FRzdHPau_Xuewchis7t_JhOihLzBaecMZpU7KRS3oXgwQhlo4zWjdFL2wuCxdEy0YlkmThaJnCZ8kiSP-TWp__84V_m7sRAenxvwYugLIwKtPWgotDO_kP_ADJMhbs
CitedBy_id crossref_primary_10_1145_3425910
Cites_doi 10.1145/1240233.1240245
10.1145/2786.2793
10.1016/0012-365X(78)90105-X
10.1016/S0304-3975(01)00411-X
10.1016/j.tcs.2004.08.015
10.1137/S089548019631030X
10.1111/j.1475-3995.2005.00497.x
10.1016/0012-365X(89)90096-4
10.1016/0196-6774(92)90061-G
ContentType Journal Article
Copyright 2017 Elsevier B.V.
Copyright Elsevier BV Sep 10, 2018
Copyright_xml – notice: 2017 Elsevier B.V.
– notice: Copyright Elsevier BV Sep 10, 2018
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.dam.2017.02.025
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 21
ExternalDocumentID 10_1016_j_dam_2017_02_025
S0166218X17301117
GroupedDBID -~X
ADEZE
AFTJW
ALMA_UNASSIGNED_HOLDINGS
FDB
OAUVE
AAYXX
AI.
CITATION
FA8
VH1
WUQ
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c325t-fb03f051b44442770b769f3548a4d8bfbfd5e54387673f17d88c7f64a85d6c0f3
IEDL.DBID .~1
ISSN 0166-218X
IngestDate Sun Jun 29 16:20:55 EDT 2025
Thu Apr 24 23:07:17 EDT 2025
Tue Jul 01 01:43:06 EDT 2025
Sat Apr 29 22:38:49 EDT 2023
IsPeerReviewed true
IsScholarly true
Keywords Greedy algorithm
Online algorithms
Online independence number
Isolated vertices
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c325t-fb03f051b44442770b769f3548a4d8bfbfd5e54387673f17d88c7f64a85d6c0f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-0725-8341
PQID 2089858775
PQPubID 2045487
PageCount 10
ParticipantIDs proquest_journals_2089858775
crossref_citationtrail_10_1016_j_dam_2017_02_025
crossref_primary_10_1016_j_dam_2017_02_025
elsevier_sciencedirect_doi_10_1016_j_dam_2017_02_025
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2018-09-10
PublicationDateYYYYMMDD 2018-09-10
PublicationDate_xml – month: 09
  year: 2018
  text: 2018-09-10
  day: 10
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Discrete Applied Mathematics
PublicationYear 2018
Publisher Elsevier B.V
Elsevier BV
Publisher_xml – name: Elsevier B.V
– name: Elsevier BV
References Garey, Johnson (br000045) 1979
Böhm, Veselý (br000015) 2016; vol. 9843
Halldórsson, Iwama, Miyazaki, Taketomi (br000070) 2002; 289
Tzeng (br000100) 1999
Boyar, Favrholdt (br000020) 2007; 3
Kudahl (br000075) 2013
Allan, Laskar (br000005) 1978; 23
Demange, Paradon, Paschos (br000035) 2005; 12
Kudahl (br000080) 2015; vol. 9079
Lehel, Kiraly (br000085) 1993
Sleator, Tarjan (br000095) 1985; 28
Lovász, Saks, Trotter (br000090) 1989; 75
Boyar, Favrholdt, Kudahl (br000025) 2016
J. Boyar, L.M. Favrholdt, P. Medvedev, The relative worst order ratio of online bipartite graph coloring, (unpublished) manuscript.
Vishwanathan (br000105) 1992; 13
Gyárfás, Király, Lehel (br000055) 1999; 12
Demange, Paschos (br000040) 2005; 332
Angelopoulos, Dorrigiv, López-Ortiz (br000010) 2007
Gyárfás, Király, Lehel (br000050) 1997
Gyárfás, Lehel (br000060) 1990; 29C
Halldórsson (br000065) 1999
Gyárfás (10.1016/j.dam.2017.02.025_br000060) 1990; 29C
Tzeng (10.1016/j.dam.2017.02.025_br000100) 1999
Böhm (10.1016/j.dam.2017.02.025_br000015) 2016; vol. 9843
Garey (10.1016/j.dam.2017.02.025_br000045) 1979
Allan (10.1016/j.dam.2017.02.025_br000005) 1978; 23
Gyárfás (10.1016/j.dam.2017.02.025_br000055) 1999; 12
Halldórsson (10.1016/j.dam.2017.02.025_br000070) 2002; 289
Lehel (10.1016/j.dam.2017.02.025_br000085) 1993
Angelopoulos (10.1016/j.dam.2017.02.025_br000010) 2007
Demange (10.1016/j.dam.2017.02.025_br000040) 2005; 332
Sleator (10.1016/j.dam.2017.02.025_br000095) 1985; 28
Gyárfás (10.1016/j.dam.2017.02.025_br000050) 1997
Kudahl (10.1016/j.dam.2017.02.025_br000080) 2015; vol. 9079
Kudahl (10.1016/j.dam.2017.02.025_br000075) 2013
Demange (10.1016/j.dam.2017.02.025_br000035) 2005; 12
Halldórsson (10.1016/j.dam.2017.02.025_br000065) 1999
Vishwanathan (10.1016/j.dam.2017.02.025_br000105) 1992; 13
Lovász (10.1016/j.dam.2017.02.025_br000090) 1989; 75
Boyar (10.1016/j.dam.2017.02.025_br000020) 2007; 3
10.1016/j.dam.2017.02.025_br000030
Boyar (10.1016/j.dam.2017.02.025_br000025) 2016
References_xml – volume: vol. 9843
  start-page: 16
  year: 2016
  end-page: 28
  ident: br000015
  article-title: Online chromatic number is PSPACE-complete
  publication-title: 27th International Workshop on Combinatorial Algorithms
– start-page: 207
  year: 1993
  end-page: 214
  ident: br000085
  article-title: On-line graph coloring and finite basis problems
  publication-title: Combinatorics: Paul Erdos is Eighty, Vol. 1
– volume: 3
  year: 2007
  ident: br000020
  article-title: The relative worst order ratio for online algorithms
  publication-title: ACM Trans. Algorithms
– volume: 12
  start-page: 185
  year: 2005
  end-page: 201
  ident: br000035
  article-title: On-line maximum-order induced hereditary subgraph problems
  publication-title: Int. Trans. Oper. Res.
– volume: vol. 9079
  start-page: 313
  year: 2015
  end-page: 324
  ident: br000080
  article-title: Deciding the on-line chromatic number of a graph with pre-coloring is PSPACE-Complete
  publication-title: Algorithms and Complexity - 9th International Conference
– start-page: 229
  year: 2007
  end-page: 237
  ident: br000010
  article-title: On the separation and equivalence of paging strategies
  publication-title: 18th ACM-SIAM Symposium on Discrete Algorithms
– year: 1997
  ident: br000050
  article-title: On-line competitive coloring algorithms. Tech. Rep. TR-9703-1
– volume: 289
  start-page: 953
  year: 2002
  end-page: 962
  ident: br000070
  article-title: Online independent sets
  publication-title: Theoret. Comput. Sci.
– year: 2013
  ident: br000075
  article-title: On-line Graph Coloring
– volume: 23
  start-page: 73
  year: 1978
  end-page: 76
  ident: br000005
  article-title: On domination and independent domination numbers of a graph
  publication-title: Discrete Math.
– volume: 12
  start-page: 385
  year: 1999
  end-page: 411
  ident: br000055
  article-title: On-line 3-chromatic graphs i. triangle-free graphs
  publication-title: SIAM J. Discrete Math.
– year: 2016
  ident: br000025
  publication-title: Theory Comput. Syst.
– volume: 75
  start-page: 319
  year: 1989
  end-page: 325
  ident: br000090
  article-title: An on-line graph coloring algorithm with sublinear performance ratio
  publication-title: Discrete Math.
– start-page: 1271
  year: 1999
  end-page: 1288
  ident: br000100
  article-title: On-line dominating set problems for graphs
  publication-title: Handbook of Combinatorial Optimization
– volume: 13
  start-page: 657
  year: 1992
  end-page: 669
  ident: br000105
  article-title: Randomized online graph coloring
  publication-title: J. Algorithms
– volume: 332
  start-page: 83
  year: 2005
  end-page: 108
  ident: br000040
  article-title: On-line vertex-covering
  publication-title: Theoret. Comput. Sci.
– volume: 28
  start-page: 202
  year: 1985
  end-page: 208
  ident: br000095
  article-title: Amortized efficiency of list update and paging rules
  publication-title: Commun. ACM
– start-page: 917
  year: 1999
  end-page: 918
  ident: br000065
  article-title: Online coloring known graphs
  publication-title: 10th ACM-SIAM Symposium on Discrete Algorithms
– volume: 29C
  start-page: 168
  year: 1990
  end-page: 176
  ident: br000060
  article-title: First fit and on-line chromatic number of families of graphs
  publication-title: Ars Combin.
– reference: J. Boyar, L.M. Favrholdt, P. Medvedev, The relative worst order ratio of online bipartite graph coloring, (unpublished) manuscript.
– year: 1979
  ident: br000045
  article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness
– volume: 3
  issue: 2
  year: 2007
  ident: 10.1016/j.dam.2017.02.025_br000020
  article-title: The relative worst order ratio for online algorithms
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/1240233.1240245
– year: 2013
  ident: 10.1016/j.dam.2017.02.025_br000075
– volume: 28
  start-page: 202
  issue: 2
  year: 1985
  ident: 10.1016/j.dam.2017.02.025_br000095
  article-title: Amortized efficiency of list update and paging rules
  publication-title: Commun. ACM
  doi: 10.1145/2786.2793
– volume: 23
  start-page: 73
  issue: 2
  year: 1978
  ident: 10.1016/j.dam.2017.02.025_br000005
  article-title: On domination and independent domination numbers of a graph
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(78)90105-X
– start-page: 207
  year: 1993
  ident: 10.1016/j.dam.2017.02.025_br000085
  article-title: On-line graph coloring and finite basis problems
– start-page: 229
  year: 2007
  ident: 10.1016/j.dam.2017.02.025_br000010
  article-title: On the separation and equivalence of paging strategies
– volume: 289
  start-page: 953
  issue: 2
  year: 2002
  ident: 10.1016/j.dam.2017.02.025_br000070
  article-title: Online independent sets
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00411-X
– volume: vol. 9843
  start-page: 16
  year: 2016
  ident: 10.1016/j.dam.2017.02.025_br000015
  article-title: Online chromatic number is PSPACE-complete
– volume: 332
  start-page: 83
  issue: 13
  year: 2005
  ident: 10.1016/j.dam.2017.02.025_br000040
  article-title: On-line vertex-covering
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2004.08.015
– ident: 10.1016/j.dam.2017.02.025_br000030
– volume: 29C
  start-page: 168
  year: 1990
  ident: 10.1016/j.dam.2017.02.025_br000060
  article-title: First fit and on-line chromatic number of families of graphs
  publication-title: Ars Combin.
– volume: 12
  start-page: 385
  year: 1999
  ident: 10.1016/j.dam.2017.02.025_br000055
  article-title: On-line 3-chromatic graphs i. triangle-free graphs
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/S089548019631030X
– year: 2016
  ident: 10.1016/j.dam.2017.02.025_br000025
  publication-title: Theory Comput. Syst.
– volume: vol. 9079
  start-page: 313
  year: 2015
  ident: 10.1016/j.dam.2017.02.025_br000080
  article-title: Deciding the on-line chromatic number of a graph with pre-coloring is PSPACE-Complete
– volume: 12
  start-page: 185
  issue: 2
  year: 2005
  ident: 10.1016/j.dam.2017.02.025_br000035
  article-title: On-line maximum-order induced hereditary subgraph problems
  publication-title: Int. Trans. Oper. Res.
  doi: 10.1111/j.1475-3995.2005.00497.x
– start-page: 1271
  year: 1999
  ident: 10.1016/j.dam.2017.02.025_br000100
  article-title: On-line dominating set problems for graphs
– start-page: 917
  year: 1999
  ident: 10.1016/j.dam.2017.02.025_br000065
  article-title: Online coloring known graphs
– year: 1997
  ident: 10.1016/j.dam.2017.02.025_br000050
– year: 1979
  ident: 10.1016/j.dam.2017.02.025_br000045
– volume: 75
  start-page: 319
  issue: 13
  year: 1989
  ident: 10.1016/j.dam.2017.02.025_br000090
  article-title: An on-line graph coloring algorithm with sublinear performance ratio
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(89)90096-4
– volume: 13
  start-page: 657
  issue: 4
  year: 1992
  ident: 10.1016/j.dam.2017.02.025_br000105
  article-title: Randomized online graph coloring
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(92)90061-G
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.2095654
Snippet An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 12
SubjectTerms Algorithms
Applied mathematics
Graphs
Greedy algorithm
Greedy algorithms
Isolated vertices
Online algorithms
Online independence number
Optimization
Title Adding isolated vertices makes some greedy online algorithms optimal
URI https://dx.doi.org/10.1016/j.dam.2017.02.025
https://www.proquest.com/docview/2089858775
Volume 246
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier ScienceDirect
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals [SCFCJ]
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20211030
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIKHN
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Free and Delayed Access Journal
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20211105
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: IXB
  dateStart: 19790901
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Freedom Collection Journals
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20211030
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: ACRLP
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1872-6771
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AKRWK
  dateStart: 19790901
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT8IwFG8IXvBg_Iwokh48mUy29ZMjogQ0cFESbku7tYoCI4BX_3Zfx4YfMRxcliXd1mZ5a3_vtX3v9xC6pKHmsQzdoruiHjWEeVoI7hluQb_GWjHi4p37A94d0vsRG5VQu4iFcW6VOfavMT1D6_xOI5dmYz4eNx7BWOGgoEZB1kkDF1FOqXBZDK4_gm8UUo4frVIsunztMYCupTnzN_dcO8WeZ-b9lSgXph6IjNDT5dH-W2v9wu9MKXX20V5uTeLW-oMPUMnMDtFuf0PFujxCt63EqSc8hk4GdmWCswTMgA54qt7gukynBsOkG9AWr2kzsJo8p4vx6mW6xCkgylRNjtGwc_fU7np56gQvJiFbeVb7xMJ40xSOUAhfC960BKYniiZSW20TZhglgIWC2EAkUsbCcqokS3jsW3KCyrN0Zk4R5koxa0PbBGyjviKaSONTx_EDUyFjZRX5hWiiOOcVd-ktJlHhQPYagTQjJ83ID-FkVXS1qTJfk2pse5kW8o5-9IwIQH9btVrxb6J8WC7huWxKJoVgZ_9r9RxVoJQ5jAR-DZVXi3dzAVbJStezbldHO63eQ3cApd7o5hNCAd1b
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELWgHCgHxCrK6gMnpNAkXnusWFSW9kKRerPsxIZC2yBarnw74yxsQj0QRTnEiRVNxm9m7PEbhI5pbHgiYz_prmlALWGBEYIHljuwr4nRjPj9zt0e79zT6wEbLKCzai-MT6sssb_A9BytyzvNUprNl-GweQfOCgcDNYhyJY3EIlqiLBY-Ajt9j75xSHmCtHo16_K1yADGlpbU3zzwHVWLnnn6V6r9PvVI5IyevpD232brF4DnVulyDa2W7iRuF1-8jhbsZAOtdD-5WKeb6LydevuEh6Bl4FimOK_ADPCAx_oZrtNsbDFE3QC3uODNwHr0kL0OZ4_jKc4AUsZ6tIXuLy_6Z52grJ0QJCRms8CZkDgYcIbCAUIJjeAtRyA-0TSVxhmXMssoATAUxEUilTIRjlMtWcqT0JFtVJtkE7uDMNeaORe7FoAbDTUxRNqQepIfiIWskw0UVqJRSUks7utbjFSVQfakQJrKS1OFMZysgU4-X3kpWDXmPUwreasfqqEA9ee9tl_9G1WOyym0y5ZkUgi2-79ej9Byp9-9VbdXvZs9VIeWPHskCvdRbfb6Zg_ARZmZw1wFPwBQeN3s
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Adding+isolated+vertices+makes+some+greedy+online+algorithms+optimal&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Boyar%2C+Joan&rft.au=Kudahl%2C+Christian&rft.date=2018-09-10&rft.issn=0166-218X&rft.volume=246&rft.spage=12&rft.epage=21&rft_id=info:doi/10.1016%2Fj.dam.2017.02.025&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2017_02_025
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon