In computer science, a charging argument is used to compare the output of an optimization algorithm to an optimal solution. It is typically used toâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- T.-H. Hubert Chan, Shaofeng H.-C. Jiang
- ACM Trans. Algorithms
- 2016

We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find the shortest tourâ€¦Â (More)

Is this relevant?

2016

2016

- Elena Grigorescu, Morteza Monemizadeh, Samson Zhou
- ArXiv
- 2016

We consider the problem of approximating a maximum weighted matching, when the edges of an underlying weighted graph G(V, E) areâ€¦Â (More)

Is this relevant?

2016

2016

A central question in algorithmic game theory is to measure the inefficiency (ratio of costs) of Nash equilibria (NE) withâ€¦Â (More)

Is this relevant?

2014

2014

- Anupam Gupta, Amit Kumar
- SODA
- 2014

In the online Steiner tree problem, the input is a set of vertices that appear one-by-one, and we have to maintain a Steiner treeâ€¦Â (More)

Is this relevant?

2014

2014

We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find a shortest tourâ€¦Â (More)

Is this relevant?

2008

2008

- Vineet Goyal, R. Ravi
- 2008

Two common approaches to model uncertainty in optimization problems are to either explicitly enumerate all the realizations ofâ€¦Â (More)

Is this relevant?

2002

2002

- Alan Roberts, Antonios Symvonis, David R. Wood
- Comput. J.
- 2002

In this paper, we consider hot-potato packet routing of one-to-one routing patterns on n-node trees. By applying a â€˜chargingâ€¦Â (More)

Is this relevant?

2000

2000

- Alan Roberts, Antonios Symvonis, David R. Wood
- SIROCCO
- 2000

In this paper we consider hot-potato packet routing on trees. As a lower bound, for all sufficiently large n we construct aâ€¦Â (More)

Is this relevant?