Click to view e-book

Click to view e-book

Click to view e-book

书本目录: “...Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems....”
Click to view e-book

Click to view e-book

Click to view e-book

Click to view e-book

Click to view e-book

Click to view e-book

书本目录: “...Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability results -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Real-world applications -- Scheduling problems....”
Click to view e-book

Click to view e-book

书本目录: “...-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. ...”
Click to view e-book

Click to view e-book

Click to view e-book

书本目录: “...Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations -- Improved Lower Bounds for Non-utilitarian Truthfulness -- Buyer-Supplier Games: Optimization over the Core -- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines -- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays -- Online Algorithm for Parallel Job Scheduling and Strip Packing -- Geometric Spanners with Small Chromatic Number -- Approximating Largest Convex Hulls for Imprecise Points -- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem -- Covering the Edges of Bipartite Graphs Using K 2,2 Graphs -- On Min-Max r-Gatherings -- On the Max Coloring Problem -- Full and Local Information in Distributed Decision Making -- The Minimum Substring Cover Problem -- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Online Unit Clustering Problem -- Better Bounds for Incremental Medians -- Minimum Weighted Sum Bin Packing -- Approximation Schemes for Packing Splittable Items with Cardinality Constraints -- A Randomized Algorithm for Two Servers in Cross Polytope Spaces -- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems -- Online Rectangle Filling....”
Click to view e-book

书本目录: “...Invited Contribution -- The Primal-Dual Approach for Online Algorithms -- Session 1: Graphs and Networks -- Independent Set with Advice: The Impact of Graph Knowledge -- Online Multi-Commodity Flow with High Demands -- Approximating Spanning Trees with Few Branches -- On the Complexity of the Regenerator Location Problem – Treewidth and Other Parameters -- Session 2: Geometric Problems -- Online Exploration of Polygons with Holes -- Probabilistic k-Median Clustering in Data Streams -- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs -- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods -- Session 3: Online Algorithms -- Asymptotically Optimal Online Page Migration on Three Points -- R–LINE: A Better Randomized 2-Server Algorithm on the Line -- Black and White Bin Packing -- Minimizing Cache Usage in Paging -- Session 4: Scheduling.Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems -- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling -- Approximating the Throughput by Coolest First Scheduling -- Algorithms for Cost-Aware Scheduling -- Session 5: Algorithmic Game Theory -- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games -- Some Anomalies of Farsighted Strategic Behavior -- Session 6: Approximation Algorithms Scheduling with an Orthogonal Resource Constraint -- Improved Approximation Guarantees for Lower-Bounded Facility Location -- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs -- Approximation Algorithms for the Wafer to Wafer Integration Problem....”
Click to view e-book

书本目录: “...Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications....”
Click to view e-book

主题: “...Online algorithms Congresses....”
Click for online access

书本目录: “...How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation....”
Click for online access

主题: Click for online access

主题: Click for online access

书本目录: Click for online access

Click to view e-book

Click to view e-book

书本目录: “...Introduction -- System model and problem formulation -- Online and offline algorithms -- Distributed online algorithm -- Communication protocols -- Future work and open problems....”
Click to view e-book

主题: Click for online access
Click for online access

主题: Click for online access

书本目录: Click for online access

书本目录: “...Equilibria in Games -- Learning and Online Algorithms -- Mechanism Design -- Social Choice -- Abstracts....”
Click for online access

书本目录: “...Approximation Algorithms -- Combinatorial Algorithms -- Combinatorial Optimization -- Computational Complexity -- Computational Geometry -- Data Structures -- Graph Algorithms -- Graph Drawing -- Parallel and Distributed Algorithms -- Parameterized Complexity -- Network Optimization -- Online Algorithms -- Randomized Algorithms -- Combinatorics -- Graph Theory -- Discrete Geometry....”
Click to view e-book

书本目录: “...Algorithms and data structures -- Algorithmic game theory; approximation algorithms and online algorithms -- Automata, languages, logic and computability -- Complexity theory -- Computational learning theory -- Cryptography, reliability and security -- Database theory, computational biology and bioinformatics -- Computational algebra, geometry, number theory, graph drawing and information visualization -- Graph theory, communication networks, optimization and parallel and distributed computing....”
Click to view e-book

书本目录: “...Privacy-Preserving Top-k Query Processing in Distributed Systems -- Trust Factors and Insider Threats in Permissioned Distributed Ledgers - An Analytical Study and Evaluation of Popular DLT Frameworks -- Polystore and Tensor Data Model for Logical Data Independence and Impedance Mismatch in Big Data Analytics -- A General Framework for Multiple Choice Question Answering Based on Mutual Information and Reinforced Co-occurrence -- Rejig: A Scalable Online Algorithm for Cache Server Configuration Changes....”
Click to view e-book

书本目录: Click for online access

书本目录: “...Turing, Computing and Communication -- Computing and Interaction -- Principles of Interactive Computation -- Theory -- A Theory of System Interaction: Components, Interfaces, and Services -- Verification of Open Systems -- A Theory of Interactive Computation -- Online Algorithms -- Interactive Algorithms 2005 with Added Appendix -- Computability Logic: A Formal Theory of Interaction -- Applications -- Human-Computer Interaction -- Modeling Web Interactions and Errors -- Composition of Interacting Computations -- From Information-Centric to Experiential Environments -- Modeling and Simulation of Large Biological, Information and Socio-Technical Systems: An Interaction Based Approach -- New Directions -- The Multidisciplinary Patterns of Interaction from Sciences to Computer Science -- Coordination -- Social Interaction, Knowledge, and Social Software -- Interaction, Computation, and Education....”
Click to view e-book

书本目录: “...Approximation Algorithm II -- On the Approximability of the Maximum Interval Constrained Coloring Problem -- Approximability of Constrained LCS -- Approximation Algorithms for the Multi-Vehicle Scheduling Problem -- On Greedy Algorithms for Decision Trees -- Session 8B. Online Algorithm -- Single and Multiple Device DSA Problem, Complexities and Online Algorithms -- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications -- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing -- On the Continuous CNN Problem -- Session 9A. ...”
Click to view e-book

书本目录: “...Insights from the Conscious Turing Machine (CTM) -- Speculative Smart Contracts -- Optimization from Structured Samples-an Effective Approach for Data-Driven Optimization -- Recent Developments in Property Testing of Boolean Functions -- AC0 Circuits, First-Order Logic, and Well-Structured graphs -- Model-Based Digital Engineering and Verification of Intelligent Systems -- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions -- Fast Sampling Constraint Satisfaction Solutions via the Lovász Local Lemma -- Pool Block Withholding Attack with Rational Miners -- Approximation Algorithms for the Directed Path Partition Problems -- Faster Algorithms for k-Subset Sum and variations -- Hardness and Algorithms for Electoral Manipulation under Media Influence -- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing....”
Click for online access

书本目录: “...Case study -- Kresna Fire (2017) -- Utilizing Minimum Set-Cover Structures with Several Constraints for Knowledge Discovery on Large Literature Databases -- Evaluation of optimal charging station location for electric vehicles: an Italian case-study -- InterCriteria Analysis of the Evaporation Parameter Influence on Ant Colony Optimization Algorithm: A Workforce Planning Problem -- Caterpillar Alignment Distance for Rooted Labeled Caterpillars: Distance Based on Alignments Required to Be Caterpillars -- ICrA over Ordered Pairs Applied to ABC Optimization Results -- A Game Theoretical Approach for VLSI Physical Design Placement -- Application of information systems and technologies in transport -- Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing....”
Click for online access

书本目录: “...Improving Linear Programming Approaches for the Steiner Tree Problem -- Algorithms and Experiments on Colouring Squares of Planar Graphs -- Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem -- Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm -- An On-Line Algorithm for the Rectangle Packing Problem with Rejection -- New Lower and Upper Bounds for Graph Treewidth -- Search Data Structures for Skewed Strings -- Evaluation of Basic Protocols for Optical Smart Dust Networks -- Linear Time Local Improvements for Weighted Matchings in Graphs -- Experimental Studies of Graph Traversal Algorithms -- A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning -- Comparing Push- and Pull-Based Broadcasting -- Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location -- A Lazy Version of Eppstein’s K Shortest Paths Algorithm -- Linear Algorithm for 3-Coloring of Locally Connected Graphs -- A Clustering Algorithm for Interval Graph Test on Noisy Data -- Core Instances for Testing: A Case Study -- The Reliable Algorithmic Software Challenge RASC -- A New Class of Greedy Heuristics for Job Shop Scheduling Problems -- Algorithmic Techniques for Memory Energy Reduction -- A Framework for Designing Approximation Algorithms for Scheduling Problems -- Analysis and Visualization of Social Networks....”
Click to view e-book

书本目录: “...Algorithmic Challenge in Online Advertising -- Parallel Algorithms for Collaborative Filtering -- On the Approximability of Some Haplotyping Problems -- On Acyclicity of Games with Cycles -- Discrete online TSP -- On Approximating an Implicit Cover Problem in Biology -- Power Indices in Spanning Connectivity Games -- Efficiently Generating k-Best Solutions to Procurement Auctions -- Integer Polyhedra for Program Analysis -- Line Segment Facility Location in Weighted Subdivisions -- Algorithms for Placing Monitors in a Flow Network -- Three Results on Frequency Assignment in Linear Cellular Networks -- Link Distance and Shortest Path Problems in the Plane -- Orca Reduction and ContrAction Graph Clustering -- Equiseparability on Terminal Wiener Index -- Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges -- Optimal Auctions Capturing Constraints in Sponsored Search -- A Note on Estimating Hybrid Frequency Moment of Data Streams -- Two-Level Push-Relabel Algorithm for the Maximum Flow Problem -- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing -- Dynamic Position Auctions with Consumer Search -- Nonlinear Optimization over a Weighted Independence System -- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers -- Latency Constrained Aggregation in Chain Networks Admits a PTAS -- Cutting a Cake for Five People -- PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications -- On Job Scheduling with Preemption Penalties....”
Click to view e-book

书本目录: “...Invited Talks -- The Web as a Graph: Measurements, Models, and Methods -- Some Observations on the Computational Complexity of Graph Accessibility Problem (Extended Abstract) -- Hao Wang Award Paper -- An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree -- Data Structures -- Theory of 2-3 Heaps -- An External Memory Data Structure for Shortest Path Queries (Extended Abstract) -- Computational Biology -- Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees -- Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations -- Graph Drawing -- An Approximation Algorithm for the Two-Layered Graph Drawing Problem -- Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs -- Layout Problems on Lattice Graphs -- Discrete Mathematics -- A New Transference Theorem in the Geometry of Numbers -- On Covering and Rank Problems for Boolean Matrices and Their Applications -- A Combinatorial Algorithm for Pfaffians -- Graph Algorithms 1 -- How to Swap a Failing Edge of a Single Source Shortest Paths Tree -- On Bounds for the k-Partitioning of Graphs -- A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs -- Automata and Language -- Probabilities to Accept Languages by Quantum Finite Automata -- Distributionally-Hard Languages -- Circuits and Context-Free Languages -- Complexity Theory and Learning -- On the Negation-Limited Circuit Complexity of Merging -- Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy -- Efficient Learning of Some Linear Matrix Languages -- Combinatorial Optimization 1 -- Minimizing Mean Response Time in Batch Processing System -- Approximation Algorithms for Bounded Facility Location -- Scheduling Trees onto Hypercubes and Grids Is NP-complete -- Graph Algorithms 2 -- Approximations of Weighted Independent Set and Hereditary Subset Problems -- Multi-coloring Trees -- On the Complexity of Approximating Colored-Graph Problems Extended Abstract -- Number Theory -- On the Average Sensitivity of Testing Square-Free Numbers -- Binary Enumerability of Real Numbers (Extended Abstract) -- GCD of Many Integers (Extended Abstract) -- Distributed Computing -- Multi-party Finite Computations -- Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs -- Combinatorial Optimization 2 -- A Dynamic-Programming Bound for the Quadratic Assignment Problem -- A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases -- Network Routing Problems -- On Routing in Circulant Graphs -- Minimum Congestion Embedding of Complete Binary Trees into Tori -- Computational Geometry -- Maximum Stabbing Line in 2D Plane -- Generalized Shooter Location Problem -- Online Algorithms -- A Competitive Online Algorithm for the Paging Problem with “Shelf” Memory -- Using Generalized Forecasts for Online Currency Conversion -- Rewriting Systems -- On S-Regular Prefix-Rewriting Systems and Automatic Structures -- Tractable and Intractable Second-Order Matching Problems -- Parallel Computing -- Efficient Fixed-Size Systolic Arrays for the Modular Multiplication -- Improving Parallel Computation with Fast Integer Sorting -- A Combinatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor -- Combinatorial Optimization 3 -- A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation -- The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set....”
Click to view e-book

书本目录: “...Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? ...”
Click to view e-book

书本目录: “...Practical Variable Length Gap Pattern Matching using Wavelet Trees -- Fast Exact Computation of Isochrones in Road Networks -- Dynamic Time-Dependent Route Planning in Road Networks with User Preferences -- UKP5: a New Algorithm for the Unbounded Knapsack Problem -- Lempel-Ziv Decoding in External Memory -- A Practical Method for the Minimum Genus of a Graph: Models and Experiments -- Compact Flow Diagrams for State Sequences -- Practical Dynamic Entropy-Compressed Bitvectors with Applications -- Accelerating Local Search for the Maximum Independent Set Problem -- Computing Nonsimple Polygons of Minimum Perimeter -- Sparse Subgraphs for 2-Connectivity in Directed Graphs -- Worst-Case-Efficient Dynamic Arrays in Practice -- On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors -- Engineering Hybrid DenseZDDs -- Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances -- Tractable Pathfinding for the Stochastic On-Time Arrival Problem -- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem -- Experimental Analysis of Algorithms for Coflow Scheduling -- An Empirical Study of Online Packet Scheduling Algorithms -- Advanced Multilevel Node Separator Algorithms -- A merging heuristic for the rectangle decomposition of binary matrice -- CHICO: A Compressed Hybrid Index for Repetitive Collections -- Fast Scalable Construction of (Minimal Perfect Hash) Functions -- Better partitions of protein graphs for subsystem quantum chemistry -- Online Algorithm for Approximate Quantile Queries on Sliding Windows....”
Click to view e-book

书本目录: “...Answers to selected problems. 4.8. Notes -- 5. Online algorithms. 5.1. List accessing problem. 5.2. Paging. 5.3. ...”
Click for online access

书本目录: “...String Algorithms -- Subsequence Covers of Words -- Maximal Closed Substrings -- Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffx Conditions -- The Complexity of the Co-Occurrence Problem -- Reconstructing Parameterized Strings from Parameterized Suffx and LCP Arrays -- Computing the Parameterized BurrowsWheeler Transform Online -- Accessing the Suffx Array via 1 Forest -- On the Optimisation of the GSACA Suffx Array Construction Algorithm -- String Compression -- Balancing Run-Length Straight-Line Programs -- Substring Complexities on Run-length Compressed Strings -- Information Retrieval -- How TrainTest Leakage Affects Zero-shot Retrieval -- Computational Biology -- Genome Comparison on Succinct Colored de Bruijn Graphs -- Sorting Genomes by Prefix Double-Cut-and-Joins -- KATKA: A KRAKEN-like Tool with k Given at Query Time -- Computing all-vs-all MEMs in Run-Length-Encoded Collections of HiFi Reads -- Space-Effcient Data Structures -- Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries -- Compressed String Dictionaries via Data-Aware Subtrie Compaction -- On representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs -- Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors -- Pattern Matching in Strings, Graphs, and Trees -- Matching Patterns with Variables Under Edit Distance -- On the Hardness of Computing the Edit Distance of Shallow Trees -- Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs -- Pattern Matching under DTW Distance....”
Click for online access

书本目录: “...Learning a stopping criteria for Local Search -- Surrogate Assisted Feature Computation for Continuous Problems -- MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework -- Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers -- Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population for Global Optimization -- Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection -- Designing and comparing multiple portfolios of parameter configurations for online algorithm selection -- Portfolios of Subgraph Isomorphism Algorithms -- Structure-preserving Instance Generation -- Feature Selection using Tabu Search with Learning Memory: Learning Tabu Search -- The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-art Inexact TSP Solvers -- Requests Management for Smartphone-based Matching Applications using a Multi-Agent Approach -- Self-Organizing Neural Network for Adaptive Operator Selection in Evolutionary Search -- Quantifying the Similarity of Algorithm Configurations -- Neighborhood synthesis from an ensemble of MIP and CP models -- Parallelizing Constraint Solvers for Hard RCPSP Instances -- Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm -- Constraint Programming and Machine Learning for Interactive Soccer Analysis -- A Matheuristic Approach for the p-Cable Trench Problem -- An Empirical Study of Per-Instance Algorithm Scheduling -- Dynamic strategy to diversify search using history map in parallel solving -- Faster Model Based Optimization through Resource Aware Scheduling Strategies -- Risk-Averse Anticipation for Dynamic Vehicle Routing -- Solving GENOPT problems with the use of ExaMin solver -- Hybridisation of Evolutionary Algorithms through Hyper-heuristics for Global Continuous Optimisation....”
Click to view e-book

书本目录: “...Searching for Applicable Versions of Computable Structures -- On Measure Quantifiers in First-Order Arithmetic -- Pistone Learning Languages with Decidable Hypotheses -- Robust Online Algorithms for Dynamic Choosing Problems -- On the degrees of constructively immune sets -- Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry -- The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines -- Randomising Realizability -- Restrictions of Hindman's Theorem: an overview -- Complexity and Categoricity of Automatic Injection structures -- A tale of optimizing the space taken by de Bruijn graphs -- Formally Computing with the Non-Computable -- Cohen Mapping Monotonic Restrictions in Inductive Inference -- Normal Forms for Semantically Witness-Based Learners in Inductive Inference -- xWalk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted -- On 3SUM-hard problems in the Decision Tree Model -- Monotonic Spectra and Their Generalizations -- On false Heine/Borel compactness principles in proof mining -- Placing Green Bridges Optimally, with a Multivariate Analysis -- A Church-Turing thesis for randomness? ...”
Click for online access

书本目录: “...-Approximate Quantiles in a Data Stream -- Improved Sublinear Time Algorithm for Width-Bounded Separators -- Constant Time Generation of Biconnected Rooted Plane Graphs -- Solving General Lattice Puzzles -- A Hybrid Graph Representation for Recursive Backtracking Algorithms -- On Tractable Exponential Sums -- Recognizing d-Interval Graphs and d-Track Interval Graphs -- Categorial Semantics of a Solution to Distributed Dining Philosophers Problem -- Approximation Algorithms for the Capacitated Domination Problem -- A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle -- FPTAS’s for Some Cut Problems in Weighted Trees -- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks -- Online Algorithms for the Newsvendor Problem with and without Censored Demands -- O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems -- Path Separability of Graphs -- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings -- Computing Minimum Diameter Color-Spanning Sets -- Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares -- Optimum Sweeps of Simple Polygons with Two Guards -- Adaptive Algorithms for Planar Convex Hull Problems -- New Algorithms for Barrier Coverage with Mobile Sensors....”
Click to view e-book

书本目录: “...Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs....”
Click to view e-book

书本目录: “...Counting With Probabilistic and Ultrametric Finite Automata -- Systolic Automata and P Systems -- Soliton Automata with Multiple Waves -- On Power Series over a Graded Monoid -- Advances on Random Sequence Generation by Uniform Cellular Automata -- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages -- Aspects of Reversibility for Classical Automata -- A Weakly Universal Cellular Automaton in the Pentagrid with Five States -- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem -- Time-Optimum Smaller-State Synchronizers for Cellular Automata -- Computing Boolean Functions via Quantum Hashing -- Complexity of Promise Problems on Classical and Quantum Automata -- Quantum Complexity of Boolean Matrix Multiplication and Related Problems -- Quantum Distributed Computing Applied to Grover's Search Algorithm -- Maximally Entangled State in Pseudo-Telepathy Games -- Quantum Finite Automata: A Modern Introduction -- Physical Aspects of Oracles for Randomness and Hadamard's Conjecture -- From Quantum Query Complexity to State Complexity -- Small Universal Devices -- A Technique to Obtain Hardness Results for Randomized Online Algorithms -- Integral Difference Ratio Functions on Integers -- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources -- Symmetries and Dualities in Name-Passing Process Calculi -- Learning from Positive Data and Negative Counterexamples -- One-Sided Random Context Grammars -- How Can We Construct Reversible Machines out of Reversible Logic Element with Memory? ...”
Click to view e-book

书本目录: “...Simulated Annealing for Planted Bisection Problems -- Web Search via Hub Synthesis -- Error-Correcting Codes and Pseudorandom Projections -- Order in Pseudorandomness -- Contributed Talks of APPROX -- Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows -- On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique -- Online Weighted Flow Time and Deadline Scheduling -- An Online Algorithm for the Postman Problem with a Small Penalty -- A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem -- Approximation Schemes for Ordered Vector Packing Problems -- Incremental Codes -- A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set -- Approximation Algorithms for Budget-Constrained Auctions -- Minimizing Average Completion of Dedicated Tasks and Interval Graphs -- A Greedy Facility Location Algorithm Analyzed Using Dual Fitting -- 0.863-Approximation Algorithm for MAX DICUT -- The Maximum Acyclic Subgraph Problem and Degree-3 Graphs -- Some Approximation Results for the Maximum Agreement Forest Problem -- Contributed Talks of RANDOM -- Near-optimum Universal Graphs for Graphs with Bounded Degrees -- On a Generalized Ruin Problem -- On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation -- Exact Sampling in Machine Scheduling Problems -- On Computing Ad-hoc Selective Families -- L Infinity Embeddings -- On Euclidean Embeddings and Bandwidth Minimization -- The Non-approximability of Non-Boolean Predicates -- On the Derandomization of Constant Depth Circuits -- Testing Parenthesis Languages -- Proclaiming Dictators and Juntas or Testing Boolean Formulae -- Equitable Coloring Extends Chernoff-Hoeffding Bounds....”
Click to view e-book