Search Results - 68W25 (Algorithms in computer science; Approximation Algorithm)~

A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set

Authors: Jiao Zhou Yingli Ran Panos M. Pardalos et al.

Source: INFORMS Journal on Computing. 37:1106-1120

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, F.2.2, 01 natural sciences, 68W25, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2301.09247

Approximation algorithms for flexible graph connectivity

Authors: Sylvia Boyd Joseph Cheriyan Arash Haddadan et al.

Contributors: Sylvia Boyd Joseph Cheriyan Arash Haddadan et al.

Source: Mathematical Programming. 204:493-516

Subject Terms: FOS: Computer and information sciences, network design, edge-connectivity of graphs, 0102 computer and information sciences, 01 natural sciences, 68W25 (Primary) 90C17, 90C27, 90C59, 05C40 (Secondary), Reliability of Networks, Network Design, Combinatorial Optimization, Computer Science - Data Structures and Algorithms, reliability of networks, combinatorial optimization, Data Structures and Algorithms (cs.DS), ddc:004, approximation algorithms, Approximation Algorithms, Edge-Connectivity of Graphs

File Description: application/pdf

Access URL: http://arxiv.org/abs/2202.13298
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.9
http://eprints.lse.ac.uk/118799/

An Improved Approximation Algorithm for the Matching Augmentation Problem

Authors: J. Cheriyan R. Cummings J. Dippel et al.

Contributors: J. Cheriyan R. Cummings J. Dippel et al.

Source: SIAM Journal on Discrete Mathematics. 37:163-190

Subject Terms: FOS: Computer and information sciences, connectivity augmentation, Discrete Mathematics (cs.DM), 68W25, 90C59, 90C27, 68R10, 05C85, network design, 0211 other engineering and technologies, forest augmentation problem, 0102 computer and information sciences, 02 engineering and technology, matching augmentation problem, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 2-Edge connected graph, ddc:004, approximation algorithms, 2-edge covers, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2007.11559
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.38

An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs

Authors: Bonnet, Édouard Rzążewski, Paweł Édouard Bonnet and Paweł Rzążewski

Contributors: Bonnet, Édouard Rzążewski, Paweł Édouard Bonnet and Paweł Rzążewski

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), string graphs, 68W25, 05C15, 05C62, Approximation algorithms, odd girth, Computer Science - Data Structures and Algorithms, Vertex Cover, FOS: Mathematics, Coloring, Computer Science - Computational Geometry, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, F.2.2, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2409.18820
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.24

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

Authors: Aprile M. Drescher M. Fiorini S. et al.

Source: Lecture Notes in Computer Science ISBN: 9783030738785

Subject Terms: FOS: Computer and information sciences, F.2.2, G.2.2, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, FOS: Mathematics, Mathematics - Combinatorics, 68W25, 05C85, 90C27, Combinatorics (math.CO), Approximation algorithm, Cluster vertex deletion, Linear programming relaxation, Sherali-Adams hierarchy, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/pdf/2007.08057
http://arxiv.org/abs/2007.08057
https://link.springer.com/chapter/10.1007/978-3-030-73879-2_24
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-08057
https://arxiv.org/abs/2007.08057
https://rd.springer.com/chapter/10.1007/978-3-030-73879-2_24
https://hdl.handle.net/11573/1705869
https://doi.org/10.1007/s10107-021-01744-w

Improved Approximation Algorithms for Flexible Graph Connectivity and Capacitated Network Design

Authors: Bansal, Ishan Cheriyan, Joseph Khanna, Sanjeev et al.

Subject Terms: FOS: Computer and information sciences, 68W25, 90C27, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2411.18809

Improved Approximation Algorithms for the Expanding Search Problem

Authors: Griesbach, Svenja M. Hommelsheim, Felix Klimm, Max et al.

Contributors: Griesbach, Svenja M. Hommelsheim, Felix Klimm, Max et al.

Subject Terms: FOS: Computer and information sciences, Traveling Repairperson Problem, Search Problem, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Expanding Search, 0102 computer and information sciences, 68W25, 68R12, ddc:004, 01 natural sciences, Graph Exploration, Approximation Algorithm

File Description: application/pdf

Access URL: http://arxiv.org/abs/2301.03638
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.54
https://portal.findresearcher.sdu.dk/da/publications/e66b48c1-e82d-4097-86af-e0715532eafd
https://doi.org/10.4230/LIPIcs.ESA.2023.54

An approximation algorithm for a general class of parametric optimization problems

Authors: Cristina Bazgan Arne Herzel Stefan Ruzika et al.

Source: Journal of Combinatorial Optimization. 43:1328-1358

Subject Terms: ddc:510, FOS: Computer and information sciences, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Article, Multi-parametric optimization, Approximation algorithm, Multi-parametric minimum, Multi-parametric knapsack problem, Multi-parametric maximization of independence systems, Primary 90C31, Secondary 90C27, 68W25, Mathematical Sciences, Information and Computing Sciences, ddc, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Optimization and Control

File Description: application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007/s10878-020-00646-5.pdf
http://arxiv.org/abs/2109.10076
https://link.springer.com/content/pdf/10.1007/s10878-020-00646-5.pdf
https://arxiv.org/pdf/2109.10076
https://arxiv.org/abs/2109.10076
https://link.springer.com/article/10.1007/s10878-020-00646-5
https://dblp.uni-trier.de/db/journals/corr/corr2109.html#abs-2109-10076
https://mediatum.ub.tum.de/doc/1761347/document.pdf
https://mediatum.ub.tum.de/doc/1799180/document.pdf
https://mediatum.ub.tum.de/doc/1586223/document.pdf
https://kluedo.ub.rptu.de/frontdoor/index/index/docId/7729
https://kluedo.ub.rptu.de/frontdoor/index/index/docId/7862

A constant-factor approximation for weighted bond cover

Authors: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. et al.

Contributors: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. et al.

Source: Journal of Computer and System Sciences. 149:103617

Subject Terms: FOS: Computer and information sciences, F.2.2, G.2.2, Graph minors, 0102 computer and information sciences, 01 natural sciences, Constant-factor approximation algorithms, Primal-dual method, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Graph modification problems, Bonds in graphs, 05C35, 05C83, 05C85, 68R10, 68W25

File Description: application/pdf

Access URL: http://arxiv.org/abs/2105.00857
https://drops.dagstuhl.de/opus/volltexte/2021/14700/
https://drops.dagstuhl.de/opus/volltexte/2021/14700/pdf/LIPIcs-APPROX7.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-00857
https://arxiv.org/abs/2105.00857
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.7

On the parenthesisations of matrix chains: All are useful, few are essential: On the parenthesisations of matrix chains: all are useful, few are essential

Authors: Francisco López Lars Karlsson Paolo Bientinesi

Source: Journal of Combinatorial Optimization. 49

Subject Terms: Matrix multiplication, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Matrix chain, Computer Sciences, Analysis of algorithms and problem complexity, matrix multiplication, Mathematical programming, Theory of compilers and interpreters, Approximation algorithm, Approximation algorithms, linear algebra compilers, matrix chain, 68N20, 68Q25, 68W25, Datavetenskap (datalogi), Linear algebra compilers, approximation algorithm, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2303.17352
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-238200

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better

Authors: Conradi, Jacobus Driemel, Anne Jacobus Conradi and Anne Driemel

Contributors: Conradi, Jacobus Driemel, Anne Jacobus Conradi and Anne Driemel

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Geometry, ddc:004, F.2.2, Clustering, Approximation algorithms, 68W25, Set cover, Fréchet distance

File Description: application/pdf

Access URL: http://arxiv.org/abs/2504.17381
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.12

Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle

Authors: Waldo Gálvez Francisco Sanhueza-Matamala José A. Soto

Source: Lecture Notes in Computer Science ISBN: 9783030927011

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, F.2.2, 01 natural sciences, 68W25

Access URL: http://arxiv.org/pdf/2111.02234
http://arxiv.org/abs/2111.02234

The matching augmentation problem: a $$\frac{7}{4}$$-approximation algorithm

Authors: J. Cheriyan J. Dippel F. Grandoni et al.

Source: Mathematical Programming. 182:315-354

Subject Terms: FOS: Computer and information sciences, 68W25, 90C59, 90C27, 68R10, 05C85, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/pdf/1810.07816
http://arxiv.org/abs/1810.07816
https://link.springer.com/article/10.1007/s10107-019-01394-z
https://arxiv.org/abs/1810.07816
https://dblp.uni-trier.de/db/journals/corr/corr1810.html#abs-1810-07816
https://arxiv.org/pdf/1810.07816.pdf
http://ui.adsabs.harvard.edu/abs/2018arXiv181007816C/abstract
https://arxiv.org/pdf/1810.07816v1
https://uwspace.uwaterloo.ca/bitstream/10012/14700/3/Dippel_Jack.pdf
https://arxiv.org/abs/1810.07816
https://uwspace.uwaterloo.ca/handle/10012/14700

Approximation algorithm for the partial set multi-cover problem

Authors: Yingli Ran Guangmo Tong Ding-Zhu Du et al.

Source: Journal of Global Optimization. 75:1133-1146

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), G.2.1, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 68W25, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/pdf/1811.08185
http://arxiv.org/abs/1811.08185
http://doi.org/10.1007/s10898-019-00804-y
https://arxiv.org/abs/1811.08185
https://link.springer.com/article/10.1007%2Fs10898-019-00804-y
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-08185
https://doi.org/10.1007/s10898-019-00804-y
https://ideas.repec.org/a/spr/jglopt/v75y2019i4d10.1007_s10898-019-00804-y.html
http://ui.adsabs.harvard.edu/abs/2018arXiv181108185S/abstract
https://arxiv.org/abs/1811.08185
https://arxiv.org/pdf/1811.08185

Improving the Approximation Ratio for Capacitated Vehicle Routing

Authors: Jannis Blauth Vera Traub Jens Vygen

Source: Lecture Notes in Computer Science ISBN: 9783030738785
Mathematical Programming, 197 (2)

Subject Terms: FOS: Computer and information sciences, 90C27 Combinatorial optimization, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 68W25 Approximation algorithms, 01 natural sciences, Computer Science - Discrete Mathematics

File Description: application/application/pdf

Access URL: http://arxiv.org/pdf/2011.05235
http://arxiv.org/abs/2011.05235
https://rd.springer.com/chapter/10.1007/978-3-030-73879-2_1
https://dblp.uni-trier.de/db/journals/corr/corr2011.html#abs-2011-05235
https://link.springer.com/chapter/10.1007/978-3-030-73879-2_1
http://hdl.handle.net/20.500.11850/554385

An improved approximation algorithm for maximizing a DR-submodular function over a convex set

Authors: Du, Donglei Liu, Zhicheng Wu, Chenchen et al.

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, E.5.3, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 68W25

Access URL: http://arxiv.org/abs/2203.14740

Approximation Algorithms for Stochastic and Risk-Averse Optimization

Authors: Jaroslaw Byrka Aravind Srinivasan

Source: SIAM Journal on Discrete Mathematics. 32:44-63

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 68W20, 68W25, 90C15

Access URL: http://arxiv.org/pdf/1712.06996
http://arxiv.org/abs/1712.06996
https://epubs.siam.org/doi/abs/10.1137/15M1043790
https://dblp.uni-trier.de/db/journals/siamdm/siamdm32.html#ByrkaS18

The preemptive resource allocation problem

Authors: Kanthi Sarpatwar Baruch Schieber Hadas Shachnai et al.

Contributors: Kanthi Sarpatwar Baruch Schieber Hadas Shachnai et al.

Source: Journal of Scheduling. 27:103-118

Subject Terms: FOS: Computer and information sciences, Machine Scheduling, G.1.6, 0102 computer and information sciences, 01 natural sciences, F.2.2, 68W25, Resource Allocation, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Vector Packing, Approximation Algorithms

File Description: application/pdf

Access URL: http://arxiv.org/abs/1811.07413
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-07413
https://drops.dagstuhl.de/opus/volltexte/2019/11588/
https://drops.dagstuhl.de/opus/volltexte/2019/11588/pdf/LIPIcs-FSTTCS-2019-26.pdf/
https://researchwith.njit.edu/en/publications/the-preemptive-resource-allocation-problem
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.26

A Simple $$(2+\epsilon )$$-Approximation Algorithm for Split Vertex Deletion

Authors: Matthew Drescher Tony Huynh Samuel Fiorini

Source: Trends in Mathematics ISBN: 9783030838225

Subject Terms: 05C17, 68W25, 05C69, 4. Education, Mathematics - Combinatorics, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/pdf/2009.11056
http://arxiv.org/abs/2009.11056
https://arxiv.org/pdf/2009.11056
https://ui.adsabs.harvard.edu/abs/2020arXiv200911056D/abstract
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-11056
https://link.springer.com/chapter/10.1007/978-3-030-83823-2_48
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-11056
https://arxiv.org/abs/2009.11056

Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

Authors: Koufogiannakis, Christos Young, Neal E

Source: Lecture Notes in Computer Science ISBN: 9783642029264
Algorithmica, vol 66, iss 1

Subject Terms: Covering, FOS: Computer and information sciences, Local ratio, Competitive analysis, G.1.6, Online algorithms, 0211 other engineering and technologies, Submodular cost, Primal-dual, 0102 computer and information sciences, 02 engineering and technology, Caching, 01 natural sciences, Approximation algorithms, 68W25, Computation Theory & Mathematics, Vertex cover, Integer linear programming, Computer Science - Distributed, Parallel, and Cluster Computing, Linear programming, Computer Science - Data Structures and Algorithms, Paging, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), Set cover

Access URL: http://arxiv.org/pdf/0807.0644.pdf
http://arxiv.org/pdf/0807.0644
http://arxiv.org/abs/0807.0644
https://www.cs.ucr.edu/%7Eneal/Koufogiannakis09Greedy
https://www.cs.ucr.edu/~neal/Koufogiannakis09Greedy.pdf
https://link.springer.com/chapter/10.1007/978-3-642-02927-1_53
https://link.springer.com/content/pdf/10.1007%2F978-3-642-02927-1_53.pdf
https://rd.springer.com/chapter/10.1007/978-3-642-02927-1_53
https://dblp.uni-trier.de/db/conf/icalp/icalp2009-1.html#KoufogiannakisY09
https://arxiv.org/abs/0807.0644
https://arxiv.org/pdf/0807.0644
http://ui.adsabs.harvard.edu/abs/2008arXiv0807.0644K/abstract
https://escholarship.org/uc/item/4m85w3rp