相关论文: When LP is the Cure for Your Matching Woes: Approx…

This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.

This paper has been merged into 1110.4604.

Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we…

Many problems in machine learning can be solved by rounding the solution of an appropriate linear program (LP). This paper shows that we can recover solutions of comparable quality by rounding an approximate LP solution instead of the ex-…

This paper is withdrawn due to some errors, which are corrected in arXiv:0912.0071v4 [cs.LG].

This paper has been withdrawn by the authors

This paper has been withdrawn, as it has been merged into arXiv:1009.6144

The Matching Augmentation Problem (MAP) has recently received significant attention as an important step towards better approximation algorithms for finding cheap $2$-edge connected subgraphs. This has culminated in a…

This paper contains results which arose from the research which led to arXiv:1801.10436, but which did not fit in arXiv:1801.10436. So arXiv:1801.10436 contains the highlight results, but there are more results which are interesting enough…

This document is a brief summary of progress that has been made on the problems posed in the document "Twenty Open Problems in Enumeration of Matchings" (also available from this server as math.CO/9801060). NOTE: This article has now been…

Removed by arXiv administration. This article was plagiarized directly from Stephen Cook's description of the problem for the Clay Mathematics Institute. See http://gauss.claymath.org:8888/millennium/P_vs_NP/pvsnp.pdf for the original text.

This paper has been merged with arXiv:0908.3765

Detecting issue framing in text - how different perspectives approach the same topic - is valuable for social science and policy analysis, yet challenging for automated methods due to subtle linguistic differences. We introduce `paired…

We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that…

This paper has been withdrawn by the author due to text overlap with arXiv:1102.5004, as well as omission of proper citations to arXiv:1110.4655 and arXiv:1111.0313

Finding a stable matching is one of the central problems in algorithmic game theory. If participants are allowed to have ties and incomplete preferences, computing a stable matching of maximum cardinality is known to be NP-hard. In this…

This article was withdrawn by the arXiv.org administrators since it plagiarizes math.AT/0401211.

This paper is withdrawn due to copyright restrictions. The final version will become available at this url: http://pubs.acs.org/journals/jpcbfh/

This manuscript, a revised version of arXiv:0811.3168v1, was inadvertently submitted as a separate paper. It can now be accessed, including some final corrections for the published version, as arXiv:0811.3168v2.

This paper has been withdrawn by the authors, since it has been merged with Part I (ID 0802.3570)