Filters








2,416 Hits in 2.2 sec

Inapproximability of Combinatorial Optimization Problems [chapter]

Luca Trevisan
2014 Paradigms of Combinatorial Optimization  
We survey results on the hardness of approximating combinatorial optimization problems. *  ...  I wish to thank Uri Feige, Johan Håstad and Subhash Khot for their comments on an earlier version of this manuscript.  ...  We also discuss the study of complexity classes of combinatorial optimization problems, of relations between average-case complexity and inapproximability, and of the issue of witness length in PCP constructions  ... 
doi:10.1002/9781119005353.ch13 fatcat:o6srcissmrepxcci27ebredg34

Inapproximability of Combinatorial Optimization Problems [chapter]

Luca Trevisan
2013 Paradigms of Combinatorial Optimization  
We survey results on the hardness of approximating combinatorial optimization problems. *  ...  I wish to thank Uri Feige, Johan Håstad and Subhash Khot for their comments on an earlier version of this manuscript.  ...  We also discuss the study of complexity classes of combinatorial optimization problems, of relations between average-case complexity and inapproximability, and of the issue of witness length in PCP constructions  ... 
doi:10.1002/9781118600207.ch13 fatcat:xjl7lrlwmje3nguo6etwiuzxwi

Inapproximability of Combinatorial Optimization Problems [article]

Luca Trevisan
2004 arXiv   pre-print
We survey results on the hardness of approximating combinatorial optimization problems.  ...  I wish to thank Uri Feige, Johan Håstad and Subhash Khot for their comments on an earlier version of this manuscript.  ...  We also discuss the study of complexity classes of combinatorial optimization problems, of relations between average-case complexity and inapproximability, and of the issue of witness length in PCP constructions  ... 
arXiv:cs/0409043v1 fatcat:tgyatqut7fen3etghmem66kk5m

Weighted amplifiers and inapproximability results for Travelling Salesman problem

Miroslav Chlebík, Janka Chlebíková
2020 Journal of combinatorial optimization  
The expander graph constructions and their variants are the main tool used in gap preserving reductions to prove approximation lower bounds of combinatorial optimisation problems.  ...  This provides a new motivation for study of expanding properties of random graphs in order to improve approximation lower bounds of TSP and other edge-weighted optimisation problems.  ...  Introduction The Travelling Salesman problem (TSP) is undoubtedly one of the most famous combinatorial optimisation problems.  ... 
doi:10.1007/s10878-020-00659-0 fatcat:5y26dlcpunhcffstuj6bbgkqlq

Inapproximability results for the lateral gene transfer problem

Bhaskar Dasgupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani
2006 Journal of combinatorial optimization  
This minimization problem, defined by Hallet and Lagergren [6] , is that of finding the most parsimonious lateral gene transfer scenario for a given pair of gene and species trees.  ...  This paper concerns the Lateral Gene Transfer Problem.  ...  Inapproximability Reductions: Key Concepts and Results In [10] Papadimitriou and Yannakakis defined the class of MAX-SNP optimization problems and a special approximation-preserving reduction, the so-called  ... 
doi:10.1007/s10878-006-8212-8 fatcat:qkxrobbdtvhxlbbi5seg6yvdky

On the inapproximability of the exemplar conserved interval distance problem of genomes

Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu
2007 Journal of combinatorial optimization  
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes.  ...  We show that the exemplar conserved interval distance problem does not admit any weak approximation within a super-linear factor of 2 7 m 1.5 , where m is the maximal length of the given genomes.  ...  Theorem 1 and a linear factor lower bound on weak approximation were reported in the preliminary version of this paper appeared in (Chen et al. 2006b ).  ... 
doi:10.1007/s10878-007-9077-1 fatcat:4sfsxmccmzhgtkjal2dbll2kle

Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs

Chunmei Liu, Yinglei Song
2010 Journal of combinatorial optimization  
in the graph and 0 < c < 1 is the constant from the inapproximability of the minimum dominating set in general graphs.  ...  In this paper, we study the parameterized complexity of Dominating Set problem in chordal graphs and near chordal graphs.  ...  Regardless of its inapproximability in general graphs, the minimum dominating set problem has a PTAS in planar graphs [2] .  ... 
doi:10.1007/s10878-010-9317-7 pmid:23874144 pmcid:PMC3713774 fatcat:c2ljayyj5nflndlo7s65jkxlge

Complexity and inapproximability results for the Power Edge Set problem

Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai
2017 Journal of combinatorial optimization  
Keywords PMU placement problem · Power Edge Set · NP-hardness · inapproximability This work was carried out as part of the SOGRID project (www.so-grid.com), co-funded by the French agency for Environment  ...  In this variant of the PMU placement problem, (single channel) PMUs are placed on the edges of an electrical network.  ...  a class of optimization problems with any kind of approximation guarantee (see also (Khanna et al., 1999) ).  ... 
doi:10.1007/s10878-017-0241-y fatcat:paiuqhni5ngnndl6sixtniwrri

Combinatorial Dominance Guarantees for Heuristic Algorithms

Daniel Berend, Steven S. Skiena, Yochai Twitto
2007 Discrete Mathematics & Theoretical Computer Science  
We prove certain limitations on the combinatorial dominance guarantees of polynomial-time approximation schemes (PTAS), and give inapproximability results for the problems above.  ...  Certain general results relating approximation ratio and combinatorial dominance guarantees for optimization problems over subsets are established.  ...  Two combinatorial optimization problems are dominance equivalent if: 1.  ... 
doi:10.46298/dmtcs.3537 fatcat:rbxjfc7oofhj7ac47hbd2jt6de

On the Approximability of Combinatorial Exchange Problems [chapter]

Moshe Babaioff, Patrick Briest, Piotr Krysta
2008 Lecture Notes in Computer Science  
We investigate the computational approximability of several social goals and show that the problems of surplus maximization and volume maximization (subject to positive surplus) are inapproximable even  ...  This yields a complete characterization of the approximability of supply chain and combinatorial exchange problems based on the size of traded bundles.  ...  Proof: We use the straightforward reduction from the optimal allocation problem for combinatorial auctions, to the problem of revenue maximization in combinatorial exchange.  ... 
doi:10.1007/978-3-540-79309-0_9 fatcat:ych3lmyo6rhnzg5ifml33kki24

Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets

Moshe Dror, James B. Orlin
2008 SIAM Journal on Discrete Mathematics  
We examine a selective list of combinatorial optimization problems in NP with respect to inapproximability (Arora and Lund, 1997) given that the ground set of elements N has additional characteristics.  ...  This suggests a partial characterization for a family of inapproximable problems. For the generalized Euclidean TSP we prove inapproximability even if the subsets are of cardinality two.  ...  Given a collection of subsets F of N , the combinatorial optimization problem is (CP) max{c(F ) : F ∈ F}.  ... 
doi:10.1137/050636589 fatcat:pcmpjtuzfnel3o2rllmw3s5kkm

VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension [article]

Elchanan Mossel, Christos Papadimitriou, Michael Schapira, Yaron Singer
2009 arXiv   pre-print
The existence of incentive-compatible computationally-efficient protocols for combinatorial auctions with decent approximation ratios is the paradigmatic problem in computational mechanism design.  ...  We apply this machinery to prove the first computational-complexity inapproximability results for incentive-compatible mechanisms for combinatorial auctions.  ...  To the best of our knowledge, none of these generalizations captures the case of k-tuples of disjoint subsets of a universe considered in this paper. In addition, no connection was previously made  ... 
arXiv:0905.1995v1 fatcat:56e5sk64yjf4jcu35zyucnuuna

Affine reductions for LPs and SDPs [article]

Gábor Braun, Sebastian Pokutta, Daniel Zink
2016 arXiv   pre-print
In the case of SDPs, we obtain inapproximability results for these problems relative to the SDP-inapproximability of MaxCUT.  ...  As a consequence we establish strong linear programming inapproximability (for LPs with a polynomial number of constraints) for many problems.  ...  We are indebted to Siu On Chan for some of the PCP inapproximability bounds as well as Santosh Vempala for the helpful discussions.  ... 
arXiv:1410.8816v5 fatcat:tqklld6tnbbmvokxxag2l6sjem

On Nontrivial Approximation of CSPs [chapter]

Johan Håstad
2006 Lecture Notes in Computer Science  
combinatorial.  ...  combinatorial.  ... 
doi:10.1007/11830924_1 fatcat:atpm4rjmljbqdomfm5phjanl5q

Parameterized lower bound and inapproximability of polylogarithmic string barcoding

Chunmei Liu, Yinglei Song, Legand L. Burge
2007 Journal of combinatorial optimization  
In this paper, we study the polylogarithmic string barcoding problem, where the lengths of the substrings in the testing set are polylogarithmically bounded.  ...  We then consider the parameterized polylogarithmic string barcoding problem, where the number of substrings in the test set is considered to be a fixed parameter k.  ...  , and inapproximability have been obtained.  ... 
doi:10.1007/s10878-007-9097-x fatcat:c4kpsfzmyvgthkwvv2a26qg7zi
« Previous Showing results 1 — 15 out of 2,416 results