|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 13 publication records. Showing 13 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marek Karpinski, Richard Schmied |
On Approximation Lower Bounds for TSP with Bounded Metrics.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Richard Schmied, Claus Viehmann |
Approximating edge dominating set in dense graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Karpinski, Richard Schmied |
On Approximation Lower Bounds for TSP with Bounded Metrics |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann |
Approximating vertex cover in dense hypergraphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann |
Approximating Subdense Instances of Covering Problems. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Karpinski, Richard Schmied, Claus Viehmann |
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Karpinski, Richard Schmied |
Improved Lower Bounds for the Shortest Superstring and Related Problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Karpinski, Richard Schmied |
Improved Lower Bounds for the Shortest Superstring and Related Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Karpinski, Richard Schmied, Claus Viehmann |
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Richard Schmied, Claus Viehmann |
Approximating Edge Dominating Set in Dense Graphs. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann |
Approximating Vertex Cover in Dense Hypergraphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann |
Approximating Subdense Instances of Covering Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mathias Hauptmann, Richard Schmied, Claus Viehmann |
On Approximation Complexity of Metric Dimension Problem. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #13 of 13 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")