Solving dynamic labeling problems to optimality using solution space reductions
Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were prev...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Cano, Rafael G. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
16 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries - Schweiss, Rüdiger ELSEVIER, 2015transfer abstract, the journal of the EATCS, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:789 ; year:2019 ; day:15 ; month:10 ; pages:77-92 ; extent:16 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.tcs.2018.08.010 |
|---|
| Katalog-ID: |
ELV047837004 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV047837004 | ||
| 003 | DE-627 | ||
| 005 | 20230626020608.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 191023s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.tcs.2018.08.010 |2 doi | |
| 028 | 5 | 2 | |a GBV00000000000741.pica |
| 035 | |a (DE-627)ELV047837004 | ||
| 035 | |a (ELSEVIER)S0304-3975(18)30526-7 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 082 | 0 | 4 | |a 690 |q VZ |
| 084 | |a 50.92 |2 bkl | ||
| 100 | 1 | |a Cano, Rafael G. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Solving dynamic labeling problems to optimality using solution space reductions |
| 264 | 1 | |c 2019transfer abstract | |
| 300 | |a 16 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. | ||
| 520 | |a Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. | ||
| 650 | 7 | |a Solution space reduction |2 Elsevier | |
| 650 | 7 | |a Dynamic map labeling |2 Elsevier | |
| 650 | 7 | |a Integer linear programming |2 Elsevier | |
| 700 | 1 | |a de Souza, Cid C. |4 oth | |
| 700 | 1 | |a de Rezende, Pedro J. |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Schweiss, Rüdiger ELSEVIER |t Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |d 2015transfer abstract |d the journal of the EATCS |g Amsterdam [u.a.] |w (DE-627)ELV013125583 |
| 773 | 1 | 8 | |g volume:789 |g year:2019 |g day:15 |g month:10 |g pages:77-92 |g extent:16 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.tcs.2018.08.010 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_40 | ||
| 936 | b | k | |a 50.92 |j Meerestechnik |q VZ |
| 951 | |a AR | ||
| 952 | |d 789 |j 2019 |b 15 |c 1015 |h 77-92 |g 16 | ||
| author_variant |
r g c rg rgc |
|---|---|
| matchkey_str |
canorafaelgdesouzacidcderezendepedroj:2019----:ovndnmcaeigrbesopiaiysnsl |
| hierarchy_sort_str |
2019transfer abstract |
| bklnumber |
50.92 |
| publishDate |
2019 |
| allfields |
10.1016/j.tcs.2018.08.010 doi GBV00000000000741.pica (DE-627)ELV047837004 (ELSEVIER)S0304-3975(18)30526-7 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Cano, Rafael G. verfasserin aut Solving dynamic labeling problems to optimality using solution space reductions 2019transfer abstract 16 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming Elsevier de Souza, Cid C. oth de Rezende, Pedro J. oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:789 year:2019 day:15 month:10 pages:77-92 extent:16 https://doi.org/10.1016/j.tcs.2018.08.010 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 789 2019 15 1015 77-92 16 |
| spelling |
10.1016/j.tcs.2018.08.010 doi GBV00000000000741.pica (DE-627)ELV047837004 (ELSEVIER)S0304-3975(18)30526-7 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Cano, Rafael G. verfasserin aut Solving dynamic labeling problems to optimality using solution space reductions 2019transfer abstract 16 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming Elsevier de Souza, Cid C. oth de Rezende, Pedro J. oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:789 year:2019 day:15 month:10 pages:77-92 extent:16 https://doi.org/10.1016/j.tcs.2018.08.010 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 789 2019 15 1015 77-92 16 |
| allfields_unstemmed |
10.1016/j.tcs.2018.08.010 doi GBV00000000000741.pica (DE-627)ELV047837004 (ELSEVIER)S0304-3975(18)30526-7 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Cano, Rafael G. verfasserin aut Solving dynamic labeling problems to optimality using solution space reductions 2019transfer abstract 16 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming Elsevier de Souza, Cid C. oth de Rezende, Pedro J. oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:789 year:2019 day:15 month:10 pages:77-92 extent:16 https://doi.org/10.1016/j.tcs.2018.08.010 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 789 2019 15 1015 77-92 16 |
| allfieldsGer |
10.1016/j.tcs.2018.08.010 doi GBV00000000000741.pica (DE-627)ELV047837004 (ELSEVIER)S0304-3975(18)30526-7 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Cano, Rafael G. verfasserin aut Solving dynamic labeling problems to optimality using solution space reductions 2019transfer abstract 16 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming Elsevier de Souza, Cid C. oth de Rezende, Pedro J. oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:789 year:2019 day:15 month:10 pages:77-92 extent:16 https://doi.org/10.1016/j.tcs.2018.08.010 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 789 2019 15 1015 77-92 16 |
| allfieldsSound |
10.1016/j.tcs.2018.08.010 doi GBV00000000000741.pica (DE-627)ELV047837004 (ELSEVIER)S0304-3975(18)30526-7 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Cano, Rafael G. verfasserin aut Solving dynamic labeling problems to optimality using solution space reductions 2019transfer abstract 16 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming Elsevier de Souza, Cid C. oth de Rezende, Pedro J. oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:789 year:2019 day:15 month:10 pages:77-92 extent:16 https://doi.org/10.1016/j.tcs.2018.08.010 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 789 2019 15 1015 77-92 16 |
| language |
English |
| source |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:789 year:2019 day:15 month:10 pages:77-92 extent:16 |
| sourceStr |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:789 year:2019 day:15 month:10 pages:77-92 extent:16 |
| format_phy_str_mv |
Article |
| bklname |
Meerestechnik |
| institution |
findex.gbv.de |
| topic_facet |
Solution space reduction Dynamic map labeling Integer linear programming |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| authorswithroles_txt_mv |
Cano, Rafael G. @@aut@@ de Souza, Cid C. @@oth@@ de Rezende, Pedro J. @@oth@@ |
| publishDateDaySort_date |
2019-01-15T00:00:00Z |
| hierarchy_top_id |
ELV013125583 |
| dewey-sort |
3620 |
| id |
ELV047837004 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV047837004</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626020608.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">191023s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2018.08.010</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000741.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV047837004</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(18)30526-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cano, Rafael G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solving dynamic labeling problems to optimality using solution space reductions</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Solution space reduction</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Dynamic map labeling</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Integer linear programming</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de Souza, Cid C.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de Rezende, Pedro J.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:789</subfield><subfield code="g">year:2019</subfield><subfield code="g">day:15</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:77-92</subfield><subfield code="g">extent:16</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2018.08.010</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">789</subfield><subfield code="j">2019</subfield><subfield code="b">15</subfield><subfield code="c">1015</subfield><subfield code="h">77-92</subfield><subfield code="g">16</subfield></datafield></record></collection>
|
| author |
Cano, Rafael G. |
| spellingShingle |
Cano, Rafael G. ddc 620 ddc 690 bkl 50.92 Elsevier Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming Solving dynamic labeling problems to optimality using solution space reductions |
| authorStr |
Cano, Rafael G. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013125583 |
| format |
electronic Article |
| dewey-ones |
620 - Engineering & allied operations 690 - Buildings |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
620 VZ 690 VZ 50.92 bkl Solving dynamic labeling problems to optimality using solution space reductions Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming Elsevier |
| topic |
ddc 620 ddc 690 bkl 50.92 Elsevier Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming |
| topic_unstemmed |
ddc 620 ddc 690 bkl 50.92 Elsevier Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming |
| topic_browse |
ddc 620 ddc 690 bkl 50.92 Elsevier Solution space reduction Elsevier Dynamic map labeling Elsevier Integer linear programming |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
s c c d scc sccd r p j d rpj rpjd |
| hierarchy_parent_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| hierarchy_parent_id |
ELV013125583 |
| dewey-tens |
620 - Engineering 690 - Building & construction |
| hierarchy_top_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV013125583 |
| title |
Solving dynamic labeling problems to optimality using solution space reductions |
| ctrlnum |
(DE-627)ELV047837004 (ELSEVIER)S0304-3975(18)30526-7 |
| title_full |
Solving dynamic labeling problems to optimality using solution space reductions |
| author_sort |
Cano, Rafael G. |
| journal |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| journalStr |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
zzz |
| container_start_page |
77 |
| author_browse |
Cano, Rafael G. |
| container_volume |
789 |
| physical |
16 |
| class |
620 VZ 690 VZ 50.92 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Cano, Rafael G. |
| doi_str_mv |
10.1016/j.tcs.2018.08.010 |
| dewey-full |
620 690 |
| title_sort |
solving dynamic labeling problems to optimality using solution space reductions |
| title_auth |
Solving dynamic labeling problems to optimality using solution space reductions |
| abstract |
Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. |
| abstractGer |
Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. |
| abstract_unstemmed |
Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 |
| title_short |
Solving dynamic labeling problems to optimality using solution space reductions |
| url |
https://doi.org/10.1016/j.tcs.2018.08.010 |
| remote_bool |
true |
| author2 |
de Souza, Cid C. de Rezende, Pedro J. |
| author2Str |
de Souza, Cid C. de Rezende, Pedro J. |
| ppnlink |
ELV013125583 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1016/j.tcs.2018.08.010 |
| up_date |
2024-07-06T17:15:05.345Z |
| _version_ |
1803850723201384448 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV047837004</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626020608.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">191023s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2018.08.010</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000741.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV047837004</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(18)30526-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cano, Rafael G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solving dynamic labeling problems to optimality using solution space reductions</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Interactive maps are maps that allow users to execute operations that alter the state of the visualization. Two of the most common operations are rotation and scaling. As one of these operations is executed, labels must maintain their size, shape and orientation. This may cause labels that were previously disjoint to overlap. For each label, we must determine a set of active ranges (i.e., intervals of angles or scales during which the label is visible) such that no pair of overlapping labels is ever active simultaneously. The objective is to maximize the total length of the active ranges of all labels. We prove a number of properties of optimal solutions which allow us to significantly reduce the size of an integer programming formulation from the literature. These properties are independent of the particular choice of operation, which makes our reduction techniques extremely flexible. We report the results of several experiments employing operations of rotation and scaling, and using two existing benchmarks with 180 real-world instances. We obtained reductions of over 100 times in the number of variables and constraints of the formulation, which led to a decrease of up to three orders of magnitude in running times.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Solution space reduction</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Dynamic map labeling</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Integer linear programming</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de Souza, Cid C.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de Rezende, Pedro J.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:789</subfield><subfield code="g">year:2019</subfield><subfield code="g">day:15</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:77-92</subfield><subfield code="g">extent:16</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2018.08.010</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">789</subfield><subfield code="j">2019</subfield><subfield code="b">15</subfield><subfield code="c">1015</subfield><subfield code="h">77-92</subfield><subfield code="g">16</subfield></datafield></record></collection>
|
| score |
7.39964 |