The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem (Englisch)
- Neue Suche nach: Liu, Y.
- Neue Suche nach: Liu, Y.
In:
THEORY OF COMPUTING SYSTEMS
;
35
;
559-564
;
2002
-
ISSN:
- Aufsatz (Zeitschrift) / Print
-
Titel:The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem
-
Beteiligte:Liu, Y. ( Autor:in )
-
Erschienen in:THEORY OF COMPUTING SYSTEMS ; 35 ; 559-564
-
Verlag:
-
Erscheinungsdatum:01.01.2002
-
Format / Umfang:6 pages
-
ISSN:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 510
- Weitere Informationen zu Dewey Decimal Classification
-
Klassifikation:
DDC: 510 -
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis – Band 35
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Improved Bounds for Functions Related to Busy BeaversBen-Amram, A. M. / Petersen, H. et al. | 2002
- 13
-
On the Representation of Real Numbers Using Regular LanguagesLecomte, P. / Rigo, M. et al. | 2001
- 39
-
Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-BoxesSarkar, P. / Maitra, S. et al. | 2002
- 59
-
Hamiltonicity of the Hierarchical Cubic NetworkFu, Jung-Sheng / Chen, Gen-Huey et al. | 2001
- 81
-
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial OnesGroß e, A. / Rothe, J. / Wechsung, G. et al. | 2002
- 97
-
Guest Editors' ForewordVijaya Ramachandran, Vijaya / Ramesh Sitaraman, Ramesh et al. | 2002
- 99
-
Sorting and Counting Networks of Arbitrary Width and Small DepthBusch, C. / Herlihy, M. et al. | 2002
- 129
-
A Comparison of Asymptotically Scalable Superscalar ProcessorsKuszmaul, B. C. / Henry, D. S. / Loh, G. H. et al. | 2002
- 151
-
Scheduling Threads for Low Space Requirement and Good LocalityNarlikar, G. J. et al. | 2002
- 189
-
A Simple and Efficient Parallel Disk MergesortBarve, R. D. / Vitter, J. S. et al. | 2002
- 217
-
Data Management in Networks: Experimental Evaluation of a Provably Good StrategyKrick, C. / Meyer auf der Heide, F. / Räcke, H. / Vöcking, B. / Westermann, M. et al. | 2002
- 251
-
On Generalized Connection CachingAlbers, Susanne et al. | 2002
- 269
-
Optimizing Traffic in DSM Clusters: Fine-Grain Memory Caching versus Page Migration/ ReplicationLai, An-Chow / Falsafi, Babak et al. | 2002
- 289
-
Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to CilkBender, Michael A. / Rabin, Michael O. et al. | 2002
- 305
-
Diffusion Schemes for Load Balancing on Heterogeneous NetworksElsässer, Robert / Monien, Burkhard / Preis, Robert et al. | 2002
- 321
-
The Data Locality of Work StealingAcar, Umut A. / Blelloch, Guy E. / Blumofe, Robert D. et al. | 2002
- 349
-
DCAS-Based Concurrent DequesAgesen, O. / Detlefs, D. L. / Flood, C. H. / Garthwaite, A. T. / Martin, P. A. / Moir, M. / Shavit, N. N. / Steele, G. L. et al. | 2002
- 349
-
\bf DCAS-Based Concurrent DequesAgesen, Ole / Detlefs, David L. / Flood, Christine H. / Garthwaite, Alexander T. / Martin, Paul A. / Moir, Mark / Shavit, Nir N. / Steele Jr., Guy L. et al. | 2002
- 389
-
Editorial Statement| 2002
- 391
-
Black-Box Correctness Tests for Basic Parallel Data StructuresGibbons, Phillip B. / Bruno, John L. / Phillips, Steven et al. | 2002
- 433
-
The Mortality Problem for Matrices of Low DimensionsBournez, O. / Branicky, M. et al. | 2002
- 449
-
The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional ProblemsAida, Shin / Schuler, Rainer / Tsukiji, Tatsuie / Watanabe, Osamu et al. | 2002
- 465
-
Corrigendum Learning Two-Type Automata from Queries and CounterexamplesYokomori, Takashi et al. | 2002
- 471
-
P Systems with Global RulesPăun, Andrei et al. | 2002
- 483
-
Programmed Mutagenesis Is UniversalKhodor, Julia / Gifford, David K. et al. | 2002
- 501
-
Characterizing the Micronuclear Gene Patterns in CiliatesEhrenfeucht, Andrzej / Harju, Tero / Petre, Ion / Rozenberg, Grzegorz et al. | 2002
- 521
-
Efficient On-Line Frequency Allocation and Call Control in Cellular NetworksCaragiannis, Ioannis / Kaklamanis, Christos / Papaioannou, Evi et al. | 2002
- 545
-
Laying Out the Interconnection Network of the Transpose BijectionEven, Shimon / Kupershtok, Roni et al. | 2002
- 559
-
The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack ProblemLiu, Yingjie et al. | 2002
- 567
-
Bulk Synchronous Parallel Algorithms for the External Memory ModelDehne / Dittrich / Hutchinson / Maheshwari et al. | 2002
- 599
-
Scheduling Time-Constrained Communication in Linear NetworksAdler / Rosenberg / Sitaraman / Unger et al. | 2002
- 625
-
Competitive Call Control in Mobile NetworksPantziou / Pentaris / Spirakis et al. | 2002
- 641
-
Polynomial-Time Algorithms for Minimum-Time Broadcast in TreesCohen / Fraigniaud / Mitjana et al. | 2002
- 667
-
Average-Case Analysis of Greedy Packet SchedulingLotker, Zvi / Patt-Shamir, Boaz et al. | 2002