On the approximability of location and network design problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Aachen
Shaker
1997
|
| Schriftenreihe: | Berichte aus der Informatik
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Würzburg, Univ., Diss., 1997 |
| Beschreibung: | IV, 203 S. graph. Darst. |
| ISBN: | 3826527186 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011434663 | ||
| 003 | DE-604 | ||
| 005 | 19990209 | ||
| 007 | t | ||
| 008 | 970708s1997 gw d||| m||| 00||| ger d | ||
| 016 | 7 | |a 950763888 |2 DE-101 | |
| 020 | |a 3826527186 |c Pb. : DM 98.00, sfr 99.00, S 689.00 |9 3-8265-2718-6 | ||
| 035 | |a (OCoLC)845456754 | ||
| 035 | |a (DE-599)BVBBV011434663 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-20 |a DE-384 |a DE-355 |a DE-29T | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a DAT 195d |2 stub | ||
| 084 | |a DAT 250d |2 stub | ||
| 100 | 1 | |a Krumke, Sven O. |e Verfasser |0 (DE-588)135671175 |4 aut | |
| 245 | 1 | 0 | |a On the approximability of location and network design problems |c Sven Oliver Krumke |
| 264 | 1 | |a Aachen |b Shaker |c 1997 | |
| 300 | |a IV, 203 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Berichte aus der Informatik | |
| 500 | |a Zugl.: Würzburg, Univ., Diss., 1997 | ||
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Multikriteria-Entscheidung |0 (DE-588)4126083-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Standortproblem |0 (DE-588)4301515-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Standortproblem |0 (DE-588)4301515-3 |D s |
| 689 | 1 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 1 | 2 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 2 | 1 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 2 | 2 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 2 | 3 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 2 | 4 | |a Multikriteria-Entscheidung |0 (DE-588)4126083-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007689987&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007689987 | |
Datensatz im Suchindex
| _version_ | 1807773490574524416 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
1
2
PRELIMINARIES
11
2.1
BASIC
NOTATION
.
11
2.2
THEORY
OF
COMPUTATION
.
12
2.3
GRAPH
THEORY
.
15
3
APPROXIMATION
ALGORITHMS
21
3.1
OPTIMIZATION
PROBLEMS
.
21
3.2
PERFORMANCE
GUARANTEES
.
24
3.3
MULTICRITERIA
AND
UNICRITERION
APPROXIMATION
.
31
3.4
HARDNESS
OF
APPROXIMATION
.
35
3.5
ALGORITHMIC
TECHNIQUES
.
37
3.6
ALTERNATIVES
TO
APPROXIMATION
ALGORITHMS
.
42
4
A
GENERALIZATION
OF
THE
P-CENTER
PROBLEM
43
4.1
INTRODUCTION
.
43
4.2
PRELIMINARIES
AND
PROBLEM
DEFINITION
.
44
4.3
RELATED
WORK
.
45
4.4
SOME
BASIC
LEMMAS
.
45
4.5
AN
APPROXIMATION
ALGORITHM
.
48
4.6
HARDNESS
RESULTS
.
51
5
COMPACT
LOCATION
PROBLEMS
55
5.1
INTRODUCTION
.
55
5.2
PRELIMINARIES
AND
PROBLEM
DEFINITIONS
.
57
5.3
RELATED
WORK
.
59
5.4
SOME
BASIC
LEMMAS
.
59
5.5
ALGORITHMS
FOR
DIAMETER
CONSTRAINED
PROBLEMS
.
62
5.6
ALGORITHMS
FOR
SUM
CONSTRAINED
PROBLEMS
.
67
5.7
EXTENSION
TO
THE
NODE-WEIGHTED
CASE
.
75
5.8
HARDNESS
RESULTS
.
76
5.9
COMPACT
LOCATION
PROBLEMS
FOR
TREE
NETWORKS
.
80
5.10
GEOMETRIC
VERSIONS
.
91
CONTENTS
6
NODE
WEIGHTED
NETWORK
UPGRADING
95
6.1
INTRODUCTION
.
95
6.2
PRELIMINARIES
AND
PROBLEM
DEFINITION
.
96
6.3
SYMMETRIC
PROBLEMS
.
97
6.4
RELATED
WORK
.100
6.5
AN
ALGORITHM
FOR
BOTTLENECK
UPGRADING
.100
6.6
USING
THE
PROOF
TECHNIQUES
FOR
THE
ANALYSIS
OF
ALGORITHMS
.
.
.
113
6.7
IMPROVED
APPROXIMATION
ALGORITHMS
FOR
UNIT
COSTS
.
116
6.8
TREEWIDTH-BOUNDED
GRAPHS
.123
6.9
HARDNESS
RESULTS
.
126
6.10
THE
LINK
DELAY
PROBLEM
.129
7
NETWORK
EDGE
IMPROVEMENT
PROBLEMS
133
7.1
INTRODUCTION
.133
7.2
PRELIMINARIES
AND
PROBLEM
DEFINITION
.134
7.3
STRUCTURE
OF
AN
OPTIMAL
SOLUTION
.
137
7.4
APPROXIMATION
ALGORITHMS
ON
GENERAL
GRAPHS
.139
7.5
EXTENSION
TO
STEINER
TREES
AND
OTHER
NETWORKS
.
149
7.6
AN
IMPROVED
ALGORITHM
FOR
LINEAR
REDUCTION
COSTS
.
151
7.7
ALGORITHMS
FOR
TREEWIDTH
BOUNDED
GRAPHS
AND
LINEAR
COSTS
.
.
154
7.8
HARDNESS
RESULTS
.159
8
EDGE
IMPROVEMENT
WITH
FOCUS
ON
CONSTRAINED
STEINER
TREES
163
8.1
INTRODUCTION
.163
8.2
PRELIMINARIES
AND
PROBLEM
DEFINITIONS
.
164
8.3
DIAMETER
CONSTRAINED
STEINER
TREES
.165
8.4
DEGREE
CONSTRAINED
STEINER
TREES
.
175
8.5
HARDNESS
RESULTS
.184
9
CONCLUSION
187
A
NOTATIONAL
CONVENTIONS
189
BIBLIOGRAPHY
190
INDEX
199 |
| any_adam_object | 1 |
| author | Krumke, Sven O. |
| author_GND | (DE-588)135671175 |
| author_facet | Krumke, Sven O. |
| author_role | aut |
| author_sort | Krumke, Sven O. |
| author_variant | s o k so sok |
| building | Verbundindex |
| bvnumber | BV011434663 |
| classification_rvk | SK 890 |
| classification_tum | DAT 195d DAT 250d |
| ctrlnum | (OCoLC)845456754 (DE-599)BVBBV011434663 |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV011434663</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19990209</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970708s1997 gw d||| m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">950763888</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3826527186</subfield><subfield code="c">Pb. : DM 98.00, sfr 99.00, S 689.00</subfield><subfield code="9">3-8265-2718-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)845456754</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011434663</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 195d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 250d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Krumke, Sven O.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135671175</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the approximability of location and network design problems</subfield><subfield code="c">Sven Oliver Krumke</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Aachen</subfield><subfield code="b">Shaker</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 203 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Berichte aus der Informatik</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Würzburg, Univ., Diss., 1997</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Multikriteria-Entscheidung</subfield><subfield code="0">(DE-588)4126083-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="3"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="4"><subfield code="a">Multikriteria-Entscheidung</subfield><subfield code="0">(DE-588)4126083-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007689987&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007689987</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV011434663 |
| illustrated | Illustrated |
| indexdate | 2024-08-19T00:25:45Z |
| institution | BVB |
| isbn | 3826527186 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007689987 |
| oclc_num | 845456754 |
| open_access_boolean | |
| owner | DE-20 DE-384 DE-355 DE-BY-UBR DE-29T |
| owner_facet | DE-20 DE-384 DE-355 DE-BY-UBR DE-29T |
| physical | IV, 203 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Shaker |
| record_format | marc |
| series2 | Berichte aus der Informatik |
| spelling | Krumke, Sven O. Verfasser (DE-588)135671175 aut On the approximability of location and network design problems Sven Oliver Krumke Aachen Shaker 1997 IV, 203 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berichte aus der Informatik Zugl.: Würzburg, Univ., Diss., 1997 Approximation (DE-588)4002498-2 gnd rswk-swf Multikriteria-Entscheidung (DE-588)4126083-1 gnd rswk-swf Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Standortproblem (DE-588)4301515-3 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Netzwerk (DE-588)4171529-9 s Algorithmus (DE-588)4001183-5 s DE-604 Standortproblem (DE-588)4301515-3 s Approximation (DE-588)4002498-2 s Polynomialzeitalgorithmus (DE-588)4199652-5 s Graph (DE-588)4021842-9 s Optimierungsproblem (DE-588)4390818-4 s NP-vollständiges Problem (DE-588)4138229-8 s Multikriteria-Entscheidung (DE-588)4126083-1 s DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007689987&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Krumke, Sven O. On the approximability of location and network design problems Approximation (DE-588)4002498-2 gnd Multikriteria-Entscheidung (DE-588)4126083-1 gnd Optimierungsproblem (DE-588)4390818-4 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Standortproblem (DE-588)4301515-3 gnd Graph (DE-588)4021842-9 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4002498-2 (DE-588)4126083-1 (DE-588)4390818-4 (DE-588)4199652-5 (DE-588)4301515-3 (DE-588)4021842-9 (DE-588)4138229-8 (DE-588)4171529-9 (DE-588)4001183-5 (DE-588)4113937-9 |
| title | On the approximability of location and network design problems |
| title_auth | On the approximability of location and network design problems |
| title_exact_search | On the approximability of location and network design problems |
| title_full | On the approximability of location and network design problems Sven Oliver Krumke |
| title_fullStr | On the approximability of location and network design problems Sven Oliver Krumke |
| title_full_unstemmed | On the approximability of location and network design problems Sven Oliver Krumke |
| title_short | On the approximability of location and network design problems |
| title_sort | on the approximability of location and network design problems |
| topic | Approximation (DE-588)4002498-2 gnd Multikriteria-Entscheidung (DE-588)4126083-1 gnd Optimierungsproblem (DE-588)4390818-4 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Standortproblem (DE-588)4301515-3 gnd Graph (DE-588)4021842-9 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Approximation Multikriteria-Entscheidung Optimierungsproblem Polynomialzeitalgorithmus Standortproblem Graph NP-vollständiges Problem Netzwerk Algorithmus Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007689987&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT krumkesveno ontheapproximabilityoflocationandnetworkdesignproblems |