did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9783540422259

Integer Programming and Combinatorial Optimization: Proceedings of the 8th International Ipco Conference, Utrecht, the Netherlands, June 13-15, 2001

by ;
  • ISBN13:

    9783540422259

  • ISBN10:

    3540422250

  • Format: Paperback
  • Copyright: 2001-07-01
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $109.00 Save up to $90.44
  • Digital
    $40.22
    Add to Cart

    DURATION
    PRICE

Supplemental Materials

What is included with this book?

Summary

Presented in two parts, this first comprehensive overview addresses all aspects of energetic ion irradiation of polymers. Earlier publications and review articles concentrated on selected topics only. And the need for such a work has grown with the dramatic increase of research and applications, such as in photoresists, waveguides, and medical dosimetry, during the last decade. The first part, Fundamentals of Ion-Irradiated Polymers, covers the physical, chemical and instrumental fundamentals; treats the specific irradiation mechanisms of low- and high-energy ions (including similarities and differences); and details the potential for future technological application. All the new findings are carefully analyzed and presented in a systematic way, while open questions are identified. The second volume, Transport Processes in Ion-Irradiated Polymers, deals with transport processes in both unirradiated and irradiated polymers. As both a review and a stimulus, this work seeks to contribute substantially to the literature and advancement of polymeric devices, from both the low- and high-energy regimes.

Table of Contents

Two O(log* κ)-Approximation Algorithms for the Asymmetric κ---Center Problem
1(14)
A. Archer
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
15(15)
Y. Azar
O. Regev
Edge Covers of Setpairs and the Iterative Rounding Method
30(15)
J. Cheriyan
S. Vempala
The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates
45(15)
C.-F.M. Chou
M. Queyranne
D. Simchi-Levi
Approximate κ-MSTs and κ-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
60(11)
F.A. Chudak
T. Roughgarden
D.P. Williamson
On the Rank of Mixed 0,1 Polyhedra
71(7)
G. Cornuejols
Y. Li
Fast 2-Variable Integer Programming
78(12)
F. Eisenbrand
G. Rote
Approximating κ-Spanner Problems for κ > 2
90(15)
M. Elkin
D. Peleg
A Matroid Generalization of the Stable Matching Polytope
105(10)
T. Fleiner
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
115(15)
L. Fleischer
Combined Connectivity Augmentation and Orientation Problems
130(15)
A. Frank
T. Kiraly
An Extension of a Theorem of Henneberg and Laman
145(15)
A. Frank
L. Szego
Bisubmodular Function Minimization
160(10)
S. Fujishige
S. Iwata
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem
170(15)
N. Garg
R. Khandekar
G. Konjevod
R. Ravi
F.S. Salman
A. Sinha
Circuit Mengerian Directed Graphs
185(11)
B. Guenin
Integral Polyhedra Related to Even Cycle and Even Cut Matroids
196(14)
B. Guenin
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems
210(16)
E. Halperin
U. Zwick
Synthesis of 2-Commodity Flow Networks
226(10)
R. Hassin
A. Levin
Bounds for Deterministic Periodic Routing Sequences
236(15)
A. Hordijk
D.A. van der Laan
Cutting Planes for Mixed 0--1 Semidefinite Programs
251(13)
G. Iyengar
M.T. Cezik
Independence Free Graphs and Vertex Connectivity Augmentation
264(16)
B. Jackson
T. Jordan
The Throughput of Sequential Testing
280(13)
M.S. Kodialam
An Explicit Exact SDP Relaxation for Nonlinear 0--1 Programs
293(11)
J.B. Lasserre
Pruning by Isomorphism in Branch-and-Cut
304(14)
F. Margot
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times
318(15)
A.J. Miller
G.L. Nemhauser
M.W.P. Savelsbergh
Fences Are Futile: On Relaxations for the Linear Ordering Problem
333(15)
A. Newman
S. Vempala
Generating Cuts from Multiple-Term Disjunctions
348(13)
M. Perregaard
E. Balas
A (2 + ϵ)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective
361(9)
M. Queyranne
M. Sviridenko
Performance Guarantees of Local Search for Multiprocessor Scheduling
370(13)
P. Schuurman
T. Vredeveld
Connected Joins in Graphs
383(13)
A. Sebo
E. Tannier
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines
396(10)
R. Sitters
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
406(17)
C. Stein
D.P. Wagner
Author Index 423

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program