|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.  |
Oper. Res. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Traveling salesman problem, Multi-criteria optimization |
| 1 | Markus Bläser, L. Shankar Ram |
Approximately Fair Cost Allocation in Metric Traveling Salesman Games. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Fair cost allocations, Traveling salesman game, Approximate fair cost allocation, Combinatorial optimization, Cooperative games |
| 1 | L. Sunil Chandran, L. Shankar Ram |
On the relationship between ATSP and the cycle cover problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram |
Network Discovery and Verification. |
IEEE Journal on Selected Areas in Communications |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-criteria Traveling Salesman Problems. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram |
Network Discovery and Verification. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram |
Network Discovery and Verification. |
Algorithms for Optimization with Incomplete Information |
2005 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram |
An Improved Approximation Algorithm for TSP with Distances One and Two. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram |
Approximate Fair Cost Allocation in Metric Traveling Salesman Games. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, L. Shankar Ram |
On the Number of Minimum Cuts in a Graph. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, L. Shankar Ram |
Approximations for ATSP with Parametrized Triangle Inequality. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, L. Shankar Ram |
On the Number of Minimum Cuts in a Graph. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")