Filters








381 Hits in 2.9 sec

Page 1921 of Mathematical Reviews Vol. , Issue 97C [page]

1997 Mathematical Reviews  
local optimization.  ...  {For the entire collection see MR 97b:68003. } 97¢:68122 68R10 68M10 68Q25 90B12 Chong, Ka Wong (HK-HNKG-CS; Hong Kong); Lam, Tak Wah (HK-HNKG-CS; Hong Kong) Improving biconnectivity approximation via  ... 

Evolutionary local search for the edge-biconnectivity augmentation problem

Günther R. Raidl, Ivana Ljubić
2002 Information Processing Letters  
a stochastic local improvement algorithm.  ...  Figure 3 . 3 Stochastic local improvement.  ... 
doi:10.1016/s0020-0190(01)00285-x fatcat:bp7ivdr4pnaupgpe52ixk5km7a

A Memetic Algorithm for Vertex-Biconnectivity Augmentation [chapter]

Sandor Kersting, Günther R. Raidl, Ivana Ljubić
2002 Lecture Notes in Computer Science  
The presented memetic algorithm includes an effective preprocessing of problem data and a fast local improvement strategy which is applied during initialization, mutation, and recombination.  ...  Only feasible, locally optimal solutions are created as candidates. Empirical results indicate the superiority of the new approach over two previous heuristic and an earlier evolutionary method.  ...  Section 4 describes the main algorithm, including a new local improvement algorithm for creating locally optimal offsprings only.  ... 
doi:10.1007/3-540-46004-7_11 fatcat:jfoiyv7z4nd3fa4sdmvjtyjpmq

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Ivana Ljubić, Günther R. Raidl
2003 Journal of Heuristics  
Local Improvement A feasible candidate solution S is said to be locally optimal with respect to the number of edges, if the removal of any edge e ∈ S violates the biconnectivity-property of graph As first  ...  ;for each solution S ∈ P do locally improve (S); repeat select two parents S 1 , S 2 ∈ P via k-ary tournament selection; S ← recombine (S 1 , S 2 ); with probability p mut : mutate (S); locally improve  ... 
doi:10.1023/b:heur.0000004810.27436.30 fatcat:ywpomoy66bhftbew4s3ziqf64a

Fast Approximation Schemes for Euclidean Multi-connectivity Problems [chapter]

Artur Czumaj, Andrzej Lingas
2000 Lecture Notes in Computer Science  
As a byproduct, we get the first known non-trivial upper bound on the number of Steiner points in an optimal solution to an instance of Euclidean minimum-cost Steiner biconnectivity.  ...  The efficiency of our scheme relies on transformations of nearly optimal low cost special spanners into sub-multigraphs having good decomposition and approximation properties and a simple subgraph connectivity  ...  Here an optimal solution to the problem without allowing Steiner points is approximated to an arbitrarily close degree via the inclusion of Steiner points.  ... 
doi:10.1007/3-540-45022-x_72 fatcat:as6r3t3hfzdajin4xybibstxtq

On optimal monitor placement for localizing node failures via network tomography

Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung
2015 Performance evaluation (Print)  
In the special case of single-node failures, we develop an improved monitor placement algorithm that is optimal for probing mechanism (ii) and has linear time complexity.  ...  To uniquely localize failed nodes, the measurement paths must show different symptoms (path states) under different failure events.  ...  Monitor placement in AS topologies (⋆: optimal value; MSC(v) is computed by enumeration in MNMP-UP; GSC(v) is used to approximate MSC(v) in MNMP-UP-g).  ... 
doi:10.1016/j.peva.2015.06.003 fatcat:ewr6bw5zzjc5hhvuwoewgrk72e

Monitor placement for maximal identifiability in network tomography

Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley
2014 IEEE INFOCOM 2014 - IEEE Conference on Computer Communications  
We prove that the proposed algorithm is optimal for 2-vertex-connected networks, and demonstrate that it is near-optimal for several real ISP topologies that are not 2-vertex-connected.  ...  For non-2-vertex-connected networks, we show via numerical evaluations on ISP topologies that our algorithm closely approximates the optimal number of identifiable links for all considered values of κ,  ...  Nevertheless, it closely approximates the optimal identification ratio for all the networks over all considered values of κ.  ... 
doi:10.1109/infocom.2014.6848079 dblp:conf/infocom/MaHLST14 fatcat:gosuppw7pnd5ln4t7qw5gbd6te

The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search

Bin Hu, Markus Leitner, Günther R. Raidl
2010 Networks  
We consider the generalized minimum edge-biconnected network problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster is required to be connected in an edge-biconnected  ...  For comparison purposes, we use a mixed integer linear programming formulation based on multi-commodity flows to solve smaller instances of this problem to proven optimality.  ...  Variable Neighborhood Descent We use the traditional general VNS scheme with VND as local improvement as described in [10, 11] .  ... 
doi:10.1002/net.20370 fatcat:tfavh74vz5hphmvpsnyy4nygxq

Blackbone2, an efficient deterministic algorithm for creating 2-connected m-dominating set-based backbones in ad hoc networks

Julien Schleich, Grégoire Danoy, Pascal Bouvry, Le Thi Hoai An
2009 Proceedings of the 7th ACM international symposium on Mobility management and wireless access - MobiWAC '09  
[1, 12] proposed an algorithm with an approximation factor of 8 and in [8] , Li et al. introduced a completely localized onephase distributed algorithm, r-CDS, with a approximation factor of 172.  ...  These algorithms are generally compared using their approximation factor n, which means that in the worst case, the size of the solution produced by the algorithm is n times the size of the optimal solution  ... 
doi:10.1145/1641776.1641791 dblp:conf/mobiwac/SchleichDBA09 fatcat:olljorao2zacppdvmb7li5cskm

Page 6223 of Mathematical Reviews Vol. , Issue 96j [page]

1996 Mathematical Reviews  
Fernandes, Ulrich Finkler and Howard Karloff, A better approximation algo- rithm for finding planar subgraphs (16-25); Ka Wong Chong and Tak Wah Lam, Improving biconnectivity approximation via lo- cal  ...  Goodrich, Fixed-dimensional parallel lin- ear programming via relative e-approximations (132-141); Leslie A. Hall, David B.  ... 

Overlapping community detection using seed set expansion

Joyce Jiyoung Whang, David F. Gleich, Inderjit S. Dhillon
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
One of the most successful techniques for finding overlapping communities is based on local optimization and expansion of a community metric around a seed set of vertices.  ...  In particular, we develop new seeding strategies for a personalized PageRank scheme that optimizes the conductance community score.  ...  The method we employ is called local optimization and expansion.  ... 
doi:10.1145/2505515.2505535 dblp:conf/cikm/WhangGD13 fatcat:attvdiyhy5hdbalmlyavxbutzm

Non-tree routing for reliability and yield improvement

Andrew B. Kahng, Bao Liu, Ion I. Mǎandoiu
2002 Computer-Aided Design (ICCAD), IEEE International Conference on  
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement.  ...  We give a compact integer program formulation which is solved in practical runtime by the commercial optimization package CPLEX for nets with up to 100 terminals.  ...  improvement.  ... 
doi:10.1145/774572.774611 dblp:conf/iccad/KahngLM02 fatcat:cn4qk7taefe4hhyufxt7clh634

Nontree Routing for Reliability and Yield Improvement

A.B. Kahng, B. Liu, I.I. Mandoiu
2004 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement.  ...  We give a compact integer program formulation which is solved in practical runtime by the commercial optimization package CPLEX for nets with up to 100 terminals.  ...  improvement.  ... 
doi:10.1109/tcad.2003.819426 fatcat:h4y5nxuwzbhh7msiioidwvwqiq

Improved prediction of protein side-chain conformations with SCWRL4

Georgii G. Krivov, Maxim V. Shapovalov, Roland L. Dunbrack
2009 Proteins: Structure, Function, and Bioinformatics  
Therefore we can minimize it for function h via the same optimization procedure. Doing this yields, a list of the optimal disulfide bonds that do not have collisions.  ...  Graph solution via tree decomposition Before the major optimization via dynamic programming is launched the interaction graph undergoes some preprocessing consisting of edge decomposition and DEE.  ... 
doi:10.1002/prot.22488 pmid:19603484 pmcid:PMC2885146 fatcat:dtj3oucsprg3tcdvcpuzr42dzy

Page 2646 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
algorithm for the minimum fill-in problem (41—47); Gruia Calinescu, Howard Karloff and Yuval Rabani, An improved approximation algo- rithm for multiway cut (48-52); Lov K.  ...  k-medians and related problems (106-113); Moses Charikar, Chandra Chekuri, Ashish Goel and Sudipto Guha, Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median  ... 
« Previous Showing results 1 — 15 out of 381 results