03937cam a2200553Ma 4500
ocn243486517
OCoLC
20200626101235.0
m o d
cr cnu---|||||
050927s1998 onc o 000 0 eng d
SFB
eng
pn
SFB
COO
DEBBG
OCLCQ
GW5XE
OCLCF
OCLCQ
OCLCO
UA@
OCLCQ
OCL
OCLCO
OCLCQ
UAB
ESU
OCLCQ
1127134075
9783540690672
(electronic bk.)
3540690670
(electronic bk.)
3540647368
9783540647362
AU@
000058011977
DEBBG
BV035103318
NZ1
15297978
(OCoLC)243486517
(OCoLC)1127134075
QA76.9.A43
A65 1998
005.1
21
MAIN
Approximation Algorithms for Combinatorial Optimization.
Berlin ;
London :
Springer,
1998.
1 online resource
text
txt
rdacontent
computer
c
rdamedia
online resource
cr
rdacarrier
Lecture Notes in Computer Science ;
1444
Serienbezeichnung
Print version record.
This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998. The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
Approximations of independent sets in graphs -- Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems -- The Steiner tree problem and its generalizations -- Approximation schemes for covering and scheduling in related machines -- One for the price of two: A unified approach for approximating covering problems -- Approximation of geometric dispersion problems -- Approximating k-outconnected subgraph problems -- Lower bounds for on-line scheduling with precedence constraints on identical machines -- Instant recognition of half integrality and 2-approximations -- The t-vertex cover problem: Extending the half integrality framework with budget constraints -- A new fully polynomial approximation scheme for the knapsack problem -- On the hardness of approximating spanners -- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks -- Approximating maximum independent set in k-clique-free graphs -- Approximating an interval scheduling problem -- Finding dense subgraphs with semidefinite programming -- Best possible approximation algorithm for MAX SAT with cardinality constraint.
Computer algorithms
Congresses.
14835
Approximation theory
Data processing
Congresses.
25412
Combinatorial optimization
Data processing
Congresses.
18096
Approximation theory
Data processing.
fast
(OCoLC)fst00811830
25413
Combinatorial optimization
Data processing.
fast
(OCoLC)fst00868981
18098
Computer algorithms.
fast
(OCoLC)fst00872010
896
Electronic books.
396
Conference papers and proceedings.
fast
(OCoLC)fst01423772
6065
Jansen, Klaus.
17523
Rolim, Jose.
25414
Lecture notes in computer science ;
1444.
25415
https://link-springer-com.libraryproxy.ist.ac.at/book/10.1007/BFb0053958
92
ATIST
377606
377606
0
0
0
0
EBook
elib
elib
2020-06-26
2020-06-26
2020-06-26
EBOOK