On the nearest neighbor rule for the metric traveling salesman problem
We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Hougardy, Stefan [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
3 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures - Miguel, F.L. ELSEVIER, 2013transfer abstract, [S.l.] |
|---|---|
| Übergeordnetes Werk: |
volume:195 ; year:2015 ; day:20 ; month:11 ; pages:101-103 ; extent:3 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.dam.2014.03.012 |
|---|
| Katalog-ID: |
ELV034420843 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV034420843 | ||
| 003 | DE-627 | ||
| 005 | 20230624013351.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2015 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.dam.2014.03.012 |2 doi | |
| 028 | 5 | 2 | |a GBVA2015005000011.pica |
| 035 | |a (DE-627)ELV034420843 | ||
| 035 | |a (ELSEVIER)S0166-218X(14)00148-6 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 510 | |
| 082 | 0 | 4 | |a 510 |q DE-600 |
| 082 | 0 | 4 | |a 070 |q VZ |
| 082 | 0 | 4 | |a 660 |q VZ |
| 082 | 0 | 4 | |a 333.7 |a 610 |q VZ |
| 084 | |a 43.12 |2 bkl | ||
| 084 | |a 43.13 |2 bkl | ||
| 084 | |a 44.13 |2 bkl | ||
| 100 | 1 | |a Hougardy, Stefan |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On the nearest neighbor rule for the metric traveling salesman problem |
| 264 | 1 | |c 2015 | |
| 300 | |a 3 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. | ||
| 650 | 7 | |a Nearest neighbor rule |2 Elsevier | |
| 650 | 7 | |a Traveling salesman problem |2 Elsevier | |
| 650 | 7 | |a Approximation algorithm |2 Elsevier | |
| 700 | 1 | |a Wilde, Mirko |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Miguel, F.L. ELSEVIER |t Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |d 2013transfer abstract |g [S.l.] |w (DE-627)ELV011300345 |
| 773 | 1 | 8 | |g volume:195 |g year:2015 |g day:20 |g month:11 |g pages:101-103 |g extent:3 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.dam.2014.03.012 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a SSG-OPC-GGO | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_130 | ||
| 936 | b | k | |a 43.12 |j Umweltchemie |q VZ |
| 936 | b | k | |a 43.13 |j Umwelttoxikologie |q VZ |
| 936 | b | k | |a 44.13 |j Medizinische Ökologie |q VZ |
| 951 | |a AR | ||
| 952 | |d 195 |j 2015 |b 20 |c 1120 |h 101-103 |g 3 | ||
| 953 | |2 045F |a 510 | ||
| author_variant |
s h sh |
|---|---|
| matchkey_str |
hougardystefanwildemirko:2015----:nhnaetegbrueoteercrvln |
| hierarchy_sort_str |
2015 |
| bklnumber |
43.12 43.13 44.13 |
| publishDate |
2015 |
| allfields |
10.1016/j.dam.2014.03.012 doi GBVA2015005000011.pica (DE-627)ELV034420843 (ELSEVIER)S0166-218X(14)00148-6 DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Hougardy, Stefan verfasserin aut On the nearest neighbor rule for the metric traveling salesman problem 2015 3 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm Elsevier Wilde, Mirko oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:195 year:2015 day:20 month:11 pages:101-103 extent:3 https://doi.org/10.1016/j.dam.2014.03.012 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 195 2015 20 1120 101-103 3 045F 510 |
| spelling |
10.1016/j.dam.2014.03.012 doi GBVA2015005000011.pica (DE-627)ELV034420843 (ELSEVIER)S0166-218X(14)00148-6 DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Hougardy, Stefan verfasserin aut On the nearest neighbor rule for the metric traveling salesman problem 2015 3 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm Elsevier Wilde, Mirko oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:195 year:2015 day:20 month:11 pages:101-103 extent:3 https://doi.org/10.1016/j.dam.2014.03.012 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 195 2015 20 1120 101-103 3 045F 510 |
| allfields_unstemmed |
10.1016/j.dam.2014.03.012 doi GBVA2015005000011.pica (DE-627)ELV034420843 (ELSEVIER)S0166-218X(14)00148-6 DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Hougardy, Stefan verfasserin aut On the nearest neighbor rule for the metric traveling salesman problem 2015 3 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm Elsevier Wilde, Mirko oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:195 year:2015 day:20 month:11 pages:101-103 extent:3 https://doi.org/10.1016/j.dam.2014.03.012 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 195 2015 20 1120 101-103 3 045F 510 |
| allfieldsGer |
10.1016/j.dam.2014.03.012 doi GBVA2015005000011.pica (DE-627)ELV034420843 (ELSEVIER)S0166-218X(14)00148-6 DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Hougardy, Stefan verfasserin aut On the nearest neighbor rule for the metric traveling salesman problem 2015 3 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm Elsevier Wilde, Mirko oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:195 year:2015 day:20 month:11 pages:101-103 extent:3 https://doi.org/10.1016/j.dam.2014.03.012 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 195 2015 20 1120 101-103 3 045F 510 |
| allfieldsSound |
10.1016/j.dam.2014.03.012 doi GBVA2015005000011.pica (DE-627)ELV034420843 (ELSEVIER)S0166-218X(14)00148-6 DE-627 ger DE-627 rakwb eng 510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Hougardy, Stefan verfasserin aut On the nearest neighbor rule for the metric traveling salesman problem 2015 3 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm Elsevier Wilde, Mirko oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:195 year:2015 day:20 month:11 pages:101-103 extent:3 https://doi.org/10.1016/j.dam.2014.03.012 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 195 2015 20 1120 101-103 3 045F 510 |
| language |
English |
| source |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:195 year:2015 day:20 month:11 pages:101-103 extent:3 |
| sourceStr |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:195 year:2015 day:20 month:11 pages:101-103 extent:3 |
| format_phy_str_mv |
Article |
| bklname |
Umweltchemie Umwelttoxikologie Medizinische Ökologie |
| institution |
findex.gbv.de |
| topic_facet |
Nearest neighbor rule Traveling salesman problem Approximation algorithm |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| authorswithroles_txt_mv |
Hougardy, Stefan @@aut@@ Wilde, Mirko @@oth@@ |
| publishDateDaySort_date |
2015-01-20T00:00:00Z |
| hierarchy_top_id |
ELV011300345 |
| dewey-sort |
3510 |
| id |
ELV034420843 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV034420843</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230624013351.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2014.03.012</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015005000011.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV034420843</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(14)00148-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">333.7</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hougardy, Stefan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the nearest neighbor rule for the metric traveling salesman problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">3</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Nearest neighbor rule</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Traveling salesman problem</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximation algorithm</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilde, Mirko</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Miguel, F.L. ELSEVIER</subfield><subfield code="t">Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">[S.l.]</subfield><subfield code="w">(DE-627)ELV011300345</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:195</subfield><subfield code="g">year:2015</subfield><subfield code="g">day:20</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:101-103</subfield><subfield code="g">extent:3</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2014.03.012</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-GGO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.12</subfield><subfield code="j">Umweltchemie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.13</subfield><subfield code="j">Umwelttoxikologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.13</subfield><subfield code="j">Medizinische Ökologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">195</subfield><subfield code="j">2015</subfield><subfield code="b">20</subfield><subfield code="c">1120</subfield><subfield code="h">101-103</subfield><subfield code="g">3</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| author |
Hougardy, Stefan |
| spellingShingle |
Hougardy, Stefan ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm On the nearest neighbor rule for the metric traveling salesman problem |
| authorStr |
Hougardy, Stefan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV011300345 |
| format |
electronic Article |
| dewey-ones |
510 - Mathematics 070 - News media, journalism & publishing 660 - Chemical engineering 333 - Economics of land & energy 610 - Medicine & health |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl On the nearest neighbor rule for the metric traveling salesman problem Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm Elsevier |
| topic |
ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm |
| topic_unstemmed |
ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm |
| topic_browse |
ddc 510 ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Nearest neighbor rule Elsevier Traveling salesman problem Elsevier Approximation algorithm |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
m w mw |
| hierarchy_parent_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| hierarchy_parent_id |
ELV011300345 |
| dewey-tens |
510 - Mathematics 070 - News media, journalism & publishing 660 - Chemical engineering 330 - Economics 610 - Medicine & health |
| hierarchy_top_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV011300345 |
| title |
On the nearest neighbor rule for the metric traveling salesman problem |
| ctrlnum |
(DE-627)ELV034420843 (ELSEVIER)S0166-218X(14)00148-6 |
| title_full |
On the nearest neighbor rule for the metric traveling salesman problem |
| author_sort |
Hougardy, Stefan |
| journal |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| journalStr |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science 000 - Computer science, information & general works 600 - Technology 300 - Social sciences |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
zzz |
| container_start_page |
101 |
| author_browse |
Hougardy, Stefan |
| container_volume |
195 |
| physical |
3 |
| class |
510 510 DE-600 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Hougardy, Stefan |
| doi_str_mv |
10.1016/j.dam.2014.03.012 |
| dewey-full |
510 070 660 333.7 610 |
| title_sort |
on the nearest neighbor rule for the metric traveling salesman problem |
| title_auth |
On the nearest neighbor rule for the metric traveling salesman problem |
| abstract |
We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. |
| abstractGer |
We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. |
| abstract_unstemmed |
We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 |
| title_short |
On the nearest neighbor rule for the metric traveling salesman problem |
| url |
https://doi.org/10.1016/j.dam.2014.03.012 |
| remote_bool |
true |
| author2 |
Wilde, Mirko |
| author2Str |
Wilde, Mirko |
| ppnlink |
ELV011300345 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1016/j.dam.2014.03.012 |
| up_date |
2024-07-06T21:04:43.105Z |
| _version_ |
1803865170227757056 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV034420843</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230624013351.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2014.03.012</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015005000011.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV034420843</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(14)00148-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">333.7</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hougardy, Stefan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the nearest neighbor rule for the metric traveling salesman problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">3</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ ( log n ) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Nearest neighbor rule</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Traveling salesman problem</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximation algorithm</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilde, Mirko</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Miguel, F.L. ELSEVIER</subfield><subfield code="t">Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">[S.l.]</subfield><subfield code="w">(DE-627)ELV011300345</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:195</subfield><subfield code="g">year:2015</subfield><subfield code="g">day:20</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:101-103</subfield><subfield code="g">extent:3</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2014.03.012</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-GGO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.12</subfield><subfield code="j">Umweltchemie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.13</subfield><subfield code="j">Umwelttoxikologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.13</subfield><subfield code="j">Medizinische Ökologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">195</subfield><subfield code="j">2015</subfield><subfield code="b">20</subfield><subfield code="c">1120</subfield><subfield code="h">101-103</subfield><subfield code="g">3</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| score |
7.3998175 |