Search
Search Results
-
Perfectly packing graphs with bounded degeneracy and many leaves
We prove that one can perfectly pack degenerate graphs into complete or dense n -vertex quasirandom graphs, provided that all the degenerate graphs...
-
-
Restriction and Steiner Tree
Restriction is a major technique in design of approximation algorithms. The Steiner minimum tree is a classic NP-hard combinatorial optimization...
-
On computing small variable disjunction branch-and-bound trees
This article investigates smallest branch-and-bound trees and their computation. We first revisit the notion of hiding sets to deduce lower bounds on...
-
-
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
for a connected graph G = ( V, E ) and a set S ⊆ V ( G ) with at least two vertices, an S -Steiner tree is a subgraph T = ( V ′, E ′) of G that is a tree with S ...
-
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem
The cost-distance Steiner tree problem asks for a Steiner tree in a graph that minimizes the total cost plus a weighted sum of path delays from the...
-
A Short Proof of the Blow-Up Lemma for Approximate Decompositions
Kim, Kühn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655–4742) greatly extended the well-known blow-up lemma of Komlós, Sárközy and...
-
Graph Theory – A Survey on the Occasion of the Abel Prize for László Lovász
In this survey, we explain a few key ideas of the theory of graphs, and how these ideas have grown to form the foundation of entire research areas....
-
A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
We consider the capacitated cycle covering problem : given an undirected, complete graph G with metric edge lengths and demands on the vertices, we...
-
Applications
This chapter, which comprises nearly half the book, is a compendium of 147 published applications of logic-based Benders decomposition (LBBD),...
-
Faster goal-oriented shortest path search for bulk and incremental detailed routing
We develop new algorithmic techniques for VLSI detailed routing. First, we improve the goal-oriented version of Dijkstra’s algorithm to find shortest...
-
-
Decomposition methods for the two-stage stochastic Steiner tree problem
A new algorithmic approach for solving the stochastic Steiner tree problem based on three procedures for computing lower bounds (dual ascent,...
-
Determinant of the Finite Volume Laplacian
The finite volume Laplacian can be defined in all dimensions and is a natural way to approximate the operator on a simplicial mesh. In the most...
-
Phase Field Approach to Optimal Packing Problems and Related Cheeger Clusters
This paper stems from the idea of adopting a new approach to solve some classical optimal packing problems for balls. In fact, we attack this kind of...
-
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
In this paper, we address the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a new...