Search Results - "Algorithm Analysis and Problem Complexity"

Temporal Network Optimization Subject to Connectivity Constraints by Mertzios, George B., Michail, Othon, Spirakis, Paul G.

“…In this work we consider temporal networks , i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete…”
Get full text

Guess Free Maximization of Submodular and Linear Sums by Feldman, Moran

“…We consider the problem of maximizing the sum of a monotone submodular function and a linear function subject to a general solvable polytope constraint…”
Get full text

Runtime Analysis for Self-adaptive Mutation Rates by Doerr, Benjamin, Witt, Carsten, Yang, Jing

“…We propose and analyze a self-adaptive version of the ( 1 , λ ) evolutionary algorithm in which the current mutation rate is encoded within the individual and thus also subject to mutation…”
Get full text

Practical Budgeted Submodular Maximization by Feldman, Moran, Nutov, Zeev, Shoham, Elad

“…We consider the problem of maximizing a non-negative monotone submodular function subject to a knapsack constraint, which is also known as the Budgeted Submodular Maximization ( BSM ) problem. Sviridenko (Operat Res Lett 32:41–43, 2004…”
Get full text

On Maximizing Sums of Non-monotone Submodular and Linear Functions by Qi, Benjamin

“…We study the problem of Regularized Unconstrained SubmodularMaximization (RegularizedUSM) as defined by Bodek and Feldman (Maximizing sums of non-monotone…”
Get full text

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima by Jorritsma, Joost, Lengler, Johannes, Sudholt, Dirk

“… Comma selection may help to escape from local optima, however when and how it is beneficial is subject to an ongoing debate…”
Get full text

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion by Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter

“… out (subject to the usual…”
Get full text

Stochastic Variance Reduction for DR-Submodular Maximization by Lian, Yuefang, Du, Donglei, Wang, Xiao, Xu, Dachuan, Zhou, Yang

“…Stochastic optimization has experienced significant growth in recent decades, with the increasing prevalence of variance reduction techniques in stochastic…”
Get full text

Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint by Huang, Chien-Chung, Kakimura, Naonori

“…In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in a streaming setting…”
Get full text

Sublinear Algorithms in T-Interval Dynamic Networks by Jahja, Irvan, Yu, Haifeng

“… The edges in the network are always undirected, but the set of edges in the topology may change arbitrarily from round to round, as determined by some adversary and subject to the following constraint…”
Get full text

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center by Kim, Kangsan, Shin, Yongho, An, Hyung-Chan

“…Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial…”
Get full text

Provenance-Aware Knowledge Representation: A Survey of Data Models and Contextualized Knowledge Graphs by Sikos, Leslie F., Philp, Dean

“…Expressing machine-interpretable statements in the form of subject-predicate-object triples is a well-established practice for capturing semantics of structured data…”
Get full text

Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under Bit-Wise Noise by Qian, Chao, Bian, Chao, Jiang, Wu, Tang, Ke

“…In many real-world optimization problems, the objective function evaluation is subject to noise, and we cannot obtain the exact objective value…”
Get full text

Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint by Huang, Chien-Chung, Kakimura, Naonori, Yoshida, Yuichi

“…In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting…”
Get full text

Energy-Optimal Routes for Battery Electric Vehicles by Baum, Moritz, Dibbelt, Julian, Pajor, Thomas, Sauer, Jonas, Wagner, Dorothea, Zündorf, Tobias

“… These restrictions can be captured by profiles , which are a functional representation of optimal energy consumption between two locations, subject to initial state of charge…”
Get full text

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation by Bille, Philip, Christiansen, Anders Roy, Cording, Patrick Hagge, Gørtz, Inge Li, Skjoldjensen, Frederik Rye, Vildhøj, Hjalte Wedel, Vind, Søren

“… We initiate the study of relative compression in a dynamic setting where the compressed source string S is subject to edit operations…”
Get full text

Dispersing Obnoxious Facilities on a Graph by Grigoriev, Alexander, Hartmann, Tim A., Lendl, Stefan, Woeginger, Gerhard J.

“… The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance δ from each…”
Get full text

A Constant-Time Algorithm for Middle Levels Gray Codes by Mütze, Torsten, Nummenpalo, Jerri

“… The question whether such a Gray code exists for any  n ≥ 1 has been the subject of intensive research during the last 30 years, and has been answered affirmatively only recently [T. Mütze…”
Get full text

Matching Regular Expressions on uncertain data by Gil, José Arturo, Santini, Simone

“…In this paper we study regular expression matching in cases in which the identity of the symbols received is subject to uncertainty…”
Get full text

An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem by Genova, Kyle, Williamson, David P.

“… of the TSP, subject to the condition that each edge is sampled with probability at most its value in the LP relaxation…”
Get full text