Network -- On the Complexity of Delaying an Adversary’s Project -- A Note on Eswaran and Tarjan’s Algorithm for the Strong Connectivity Augmentation Problem -- Integer and Mixed Integer Programming -- Generating Set Partitioning Test Problems with Known Optimal Integer Solutions -- Computational Aspects of Controlled Tabular Adjustment: Algorithm and Analysis -- The Symphony Callable Librar…
Contributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the B…
Invited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed…
Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branc…
Puzzles, Art, and Magic with Algorithms -- The ABCs of AVDs: Geometric Retrieval Made Simple -- Pareto Optimality in House Allocation Problems -- Property-Preserving Data Reconstruction -- On the Monotone Circuit Complexity of Quadratic Boolean Functions -- Generalized Function Matching -- Approximate Distance Oracles for Graphs with Dense Clusters -- Multicriteria Global Minimum Cuts -- Polyli…
Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minim…
Global optimization -- The Motivation for Differential Evolution -- Critical values for the control parameters of differential evolution algorithms -- The Differential Evolution Algorithm -- Fast Evolution Strategies -- Benchmarking Differential Evolution -- On the usage of differential evolution for function optimization -- Problem Domains -- Shape design and optimization by genetic algorithm …
Resource Allocation Systems: Concepts and Problems -- Logical Control of Disjunctive / Conjunctive Resource Allocation Systems -- Sequential RAS Admitting Optimal Nonblocking Supervision of Polynomial Complexity -- Polynomial-Kernel Nonblocking Supervisory Control Policies for Single-Unit RAS -- Logical Control of RAS with Complex Process Flows -- Performance-Oriented Modelling and Control of L…