41

Jin, Ruoming

2021

2021

**Table of Contents:**“... for Budgeted $k$-Submodular Maximization problem -- Approximation algorithms for the lower bounded correlation clustering problem -- Approximation Algorithm for Maximizing Nonnegative Weakly Mono-tonic Set Functions -- Differentially Private Submodular Maximization...”

Full text

42

Du, Hongwei

2021

2021

**Table of Contents:**“...Approximation Algorithms -- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations -- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties -- Approximation algorithms for the maximum...”

Full text

43

Chen, Chi-Yeh

2021

2021

**Table of Contents:**“... -- On Singleton Congestion Games with Resilience Against Collusion -- A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph -- Approximation Algorithms -- General Max-Min Fair Allocation -- On the approximation hardness of geodetic set and its variants...”

Full text

44

Du, Ding-Zhu

2021

2021

**Table of Contents:**“...Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem...”

Full text

45

Flocchini, Paola

2021

2021

**Table of Contents:**“... on regular graphs -- Complexity and Algorithms for MUL-Tree Pruning -- Makespan Trade-offs for Visiting Triangle Edges -- Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k -- Approximation algorithms for hitting subgraphs -- Isomorphic unordered...”

Full text

46

Mudgal, Apurva

2021

2021

**Table of Contents:**“...Approximation Algorithms -- Online bin packing with overload cost -- Scheduling Trains with Small Stretch on a Unidirectional Line -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- Approximation Algorithms...”

Full text

47

Hong, Seok-Hee

2021

2021

**Table of Contents:**“...-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration...”

Full text

48

Tian, Hui

2021

2021

**Table of Contents:**“... learning and massive features from multi-sequence alignment -- See Fine Color from the Rough Black-and-White -- Data Aggregation Aware Routing for Distributed Training -- A New Integer Programming Model for the File Transfer Scheduling Problem -- Approximation...”

Full text

49

Roma, Nuno

2021

2021

**Table of Contents:**“... Scheduling Perspective -- A log-linear(2+5/6)-approximation algorithm for parallel machine scheduling with a single orthogonal resource -- An MPI-Parallel Algorithm for Mapping Complex Networks onto Hierarchical Architectures -- Pipelined Model Parallelism...”

Full text

50

Koenemann, Jochen

2021

2021

**Table of Contents:**“...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...”

Full text

51

Singh, Mohit

2021

2021

**Table of Contents:**“... for the Simplex Method -- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators -- A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem -- Fixed Parameter Approximation Scheme for Min-max k-cut -- Computational Aspects...”

Full text

52

Kaklamanis, Christos

2021

2021

**Table of Contents:**“...Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems...”

Full text

53

Bernard, Alain

2021

2021

**Table of Contents:**“... Merger and Routing Optimization -- A MILP model for the scheduling of a multiproduct tree-structure pipeline network in mining industry -- Exploiting the full potential of I4.0 technologies for products EOL recovery process -- An Approximation Algorithm...”

Full text

54

Batagelj, Vladimir

2021

2021

**Table of Contents:**“... Instances -- Fast Approximation Algorithms for Stabbing Special Families of Line Segments with Equal Disks -- Process Mining -- Checking Conformance between Colored Petri Nets and Event Logs -- Data and Reference Semantic-Based Simulator of DB-nets with the Use...”

Full text

55

Gupta, Nishu

2021

2021

**Table of Contents:**“... of Vehicles -- CHAPTER 10: Approximation Algorithm and Linear Congruence: A state-of-art Approach in Information Security issues towards Internet of Vehicles -- CHAPTER 11: E-powertrain error detection using AI Techniques....”

Full text

56

Jiang, Dingde

2021

2021

**Table of Contents:**“... based on system dynamics model -- Accelerating method of evolutionary ensemble learning based on Gaussian random field -- Approximation algorithms for the balanced optimization splicing problem in undirected graph -- The Influence of Employees' Financial...”

Full text

57

Jiang, Dingde

2021

2021

**Table of Contents:**“... based on system dynamics model -- Accelerating method of evolutionary ensemble learning based on Gaussian random field -- Approximation algorithms for the balanced optimization splicing problem in undirected graph -- The Influence of Employees' Financial...”

Full text

58

Sahinalp, S. Cenk

2017

2017

**Table of Contents:**“...-free and reference-free read compression -- A fast approximate algorithm for mapping long reads to large reference databases -- Determining the consistency of resolved triplets and fan triplets -- Progressive calibration and averaging for tandem mass...”

Full text

59

ChÃ¡vez, Edgar

2016

2016

**Table of Contents:**“... -- From Discrepancy to Majority -- On the Planar Split Thickness of Graphs -- A Bounded-Risk Mechanism for the Kidney Exchange Game -- Tight Approximations of Degeneracy in Large Graphs -- Improved Approximation Algorithms for Capacitated Fault-Tolerant k...”

Full text

60