Algorithms – ESA 2004

DOI10.1007/B100428MaRDI QIDQ5464598zbMATH OpenOpenAlexFDO

Authors Refael Hassin, Shlomi Rubinstein

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

zbMATH Keywords

2-edge pathsAnalysis of algorithmsmaximum triangle packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Randomized algorithms (68W20) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• An approximation algorithm for maximum triangle packing
• An improved randomized approximation algorithm for maximum triangle packing
• A randomized approximation algorithm for metric triangle packing
• An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
• A randomized approximation algorithm for metric triangle packing

Cites work

• A fast and simple randomized parallel algorithm for the maximal independent set problem
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
• An Analysis of the Greedy Heuristic for Independence Systems
• An approximation algorithm for maximum packing of 3-edge paths
• scientific article; zbMATH DE number 1187152 (Why is no real title available?)
• Maximizing traveling salesman problem for special matrices
• The maximum travelling salesman problem on symmetric Demidenko matrices
• Two Algorithmic Results for the Traveling Salesman Problem

Cited in

(20)

• On approximating four covering and packing problems
• An improved randomized approximation algorithm for maximum triangle packing
• Optimal packing of similar triangles
• Improved approximation algorithms for weighted 2-path partitions
• Using shortcut edges to maximize the number of triangles in graphs
• A heuristic algorithm for solving triangle packing problem
• Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
• Packing triangles in low degree graphs and indifference graphs
• An approximation algorithm for maximum triangle packing
• Improved approximation algorithms for weighted 2-path partitions
• An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
• scientific article; zbMATH DE number 5695819 (Why is no real title available?)
• Packing triangles in low degree graphs and indifference graphs
• Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing
• Approximation algorithms for maximum weight k-coverings of graphs by packings
• Triangle packing in (sparse) tournaments: approximation and kernelization
• A randomized approximation algorithm for metric triangle packing
• A randomized approximation algorithm for metric triangle packing
• Approximation algorithms for the maximum-weight cycle/path packing problems
• Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing

This page was built for publication: Algorithms – ESA 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464598)