|
|
|
|
LEADER |
04202nam a2200577 4500 |
001 |
978-3-540-44436-7 |
003 |
DE-He213 |
005 |
20191022042656.0 |
007 |
cr nn 008mamaa |
008 |
100301s2000 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540444367
|9 978-3-540-44436-7
|
024 |
7 |
|
|a 10.1007/3-540-44436-X
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.6-76.66
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UM
|2 thema
|
082 |
0 |
4 |
|a 005.11
|2 23
|
245 |
1 |
0 |
|a Approximation Algorithms for Combinatorial Optimization
|h [electronic resource] :
|b Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings /
|c edited by Klaus Jansen, Samir Khuller.
|
250 |
|
|
|a 1st ed. 2000.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2000.
|
300 |
|
|
|a X, 282 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1913
|
505 |
0 |
|
|a Invited Talks -- Approximation Algorithms That Take Advice -- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations -- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary -- Approximation Algorithms for Facility Location Problems -- Contributed Talks -- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts -- Maximizing Job Benefits On-Line -- Variable Length Sequencing with Two Lengths -- Randomized Path Coloring on Binary Trees -- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem -- Greedy Approximation Algorithms for Finding Dense Components in a Graph -- Online Real-Time Preemptive Scheduling of Jobs with Deadlines -- On the Relative Complexity of Approximate Counting Problems -- On the Hardness of Approximating NP Witnesses -- Maximum Dispersion and Geometric Maximum Weight Cliques -- New Results for Online Page Replication -- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses -- Approximation Algorithms for a Capacitated Network Design Problem -- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem -- Improved Approximations for Tour and Tree Covers -- Approximating Node Connectivity Problems via Set Covers -- Rectangle Tiling -- Primal-Dual Approaches to the Steiner Problem -- On the Inapproximability of Broadcasting Time -- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems -- Partial Servicing of On-Line Jobs -- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Application software.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer graphics.
|
650 |
1 |
4 |
|a Programming Techniques.
|0 http://scigraph.springernature.com/things/product-market-codes/I14010
|
650 |
2 |
4 |
|a Data Structures and Information Theory.
|0 http://scigraph.springernature.com/things/product-market-codes/I15009
|
650 |
2 |
4 |
|a Computer Applications.
|0 http://scigraph.springernature.com/things/product-market-codes/I23001
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
650 |
2 |
4 |
|a Data Structures.
|0 http://scigraph.springernature.com/things/product-market-codes/I15017
|
650 |
2 |
4 |
|a Computer Graphics.
|0 http://scigraph.springernature.com/things/product-market-codes/I22013
|
700 |
1 |
|
|a Jansen, Klaus.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Khuller, Samir.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662188859
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540679967
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1913
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-44436-X
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|