Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm - SODA '06 2006
DOI: 10.1145/1109557.1109643
|View full text |Cite
|
Sign up to set email alerts
|

Weighted isotonic regression under the L1 norm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
35
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 15 publications
(36 citation statements)
references
References 0 publications
1
35
0
Order By: Relevance
“…For example, suppose the values and weights on a linear ordering are (4,1), (3,10), (1,1), (2,1). The first partitioning involves values 2 and 3, and results in all vertices being assigned to the interval [3,4].…”
Section: Partitioningmentioning
confidence: 99%
See 4 more Smart Citations
“…For example, suppose the values and weights on a linear ordering are (4,1), (3,10), (1,1), (2,1). The first partitioning involves values 2 and 3, and results in all vertices being assigned to the interval [3,4].…”
Section: Partitioningmentioning
confidence: 99%
“…A d-dimensional grid has Θ(dn) grid edges, and thus the general algorithm in [2] shows that the L 1 isotonic regression can be found in Θ(n 2 log n) time. However for vertices in arbitrary positions Θ(n 2 ) edges may be needed, as is shown in Figure 2, which would result in Θ(n 3 ) time.…”
Section: Multidimensional Orderingsmentioning
confidence: 99%
See 3 more Smart Citations