-
181
Approximate Local Search in Combinatorial Optimization
Published 2003Subjects: Get full text
Working Paper -
182
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
Published 2004Subjects: Get full text
Working Paper -
183
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
Published 2020-11-01Subjects: Get full text
Article -
184
Automatic Unsupervised Texture Recognition Framework Using Anisotropic Diffusion-Based Multi-Scale Analysis and Weight-Connected Graph Clustering
Published 2021-05-01Subjects: Get full text
Article -
185
A Survey on the <i>k</i>-Path Vertex Cover Problem
Published 2022-04-01Subjects: Get full text
Article -
186
A Conflict-Aware Channel Assignment in Multi-Radio Multi-Channel Wireless Mesh Networks
Published 2024-01-01Subjects: Get full text
Article -
187
Combinatorial Resource Allocation in UAV-Assisted 5G/B5G Heterogeneous Networks
Published 2023-01-01Subjects: Get full text
Article -
188
Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks
Published 2019-03-01Subjects: Get full text
Article -
189
Packing triangles in low degree graphs and indifference graphs
Published 2005-01-01Subjects: Get full text
Article -
190
-
191
-
192
-
193
Combinatorial Dominance Guarantees for Heuristic Algorithms
Published 2007-01-01Subjects: Get full text
Article -
194
Signal Processing Research Program
Published 2010Subjects: “…The Application of Complex Approximation Algorithms to the Design of Robust Range-Dependent Beamformers…”
Get full text
Technical Report -
195
Approximating Buy-at-Bulk k-Steiner trees
Published 2006“…Marathe et al \cite{ravi}gave an $(O(\log n),O(\log n))$-approximation algorithm for thebicriteria Steiner tree problem. …”
Get full text
-
196
Efficient CSL Model Checking Using Stratification
Published 2012-07-01“…Their proof can be turned into an approximation algorithm with worse than exponential complexity. …”
Get full text
Article -
197
Keyword-aware optimal route search
Published 2014“…Based on this algorithm, another more efficient approximation algorithm BucketBound is proposed. We also design a greedy approximation algorithm. …”
Get full text
Get full text
Get full text
Journal Article -
198
Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem
Published 2005-02-01“…This problem is NP-hard and it is known that a polynomial approximation algorithm cannot exist. We present an in-approximability result for the GMST problem and under special assumptions: cost function satisfying the triangle inequality and with cluster sizes bounded by \(\rho\), we give an approximation algorithm with ratio \(2 \rho\).…”
Get full text
Article -
199
IoT Fog Computing Optimization Method Based on Improved Convolutional Neural Network
Published 2024-01-01“…The value function approximation algorithm of the convolutional neural network is used to solve the problem. …”
Get full text
Article -
200
Max-min fair allocation for resources with hybrid divisibilities
Published 2021“…Moreover, we propose an approximation algorithm for the general case based on the augmented flow idea. …”
Get full text
Journal Article