Local Approximability of Max-Min and Min-Max Linear Programs
In a max-min LP , the objective is to maximise ω subject to A x ≤ 1 , C x ≥ ω 1 , and x ≥ 0 . In a min-max LP , the objective is to minimise ρ subject to A x ≤ ρ 1 , C x ≥ 1 , and x ≥ 0 . The matrices A and C are nonnegative and sparse: each row a i of A has at most Δ I positive elements, and each r...
Gespeichert in:
| Veröffentlicht in: | Theory of computing systems Jg. 49; H. 4; S. 672 - 697 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Springer-Verlag
01.11.2011
Springer Nature B.V |
| Schlagworte: | |
| ISSN: | 1432-4350, 1433-0490 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In a
max-min LP
, the objective is to maximise
ω
subject to
A
x
≤
1
,
C
x
≥
ω
1
, and
x
≥
0
. In a
min-max LP
, the objective is to minimise
ρ
subject to
A
x
≤
ρ
1
,
C
x
≥
1
, and
x
≥
0
. The matrices
A
and
C
are nonnegative and sparse: each row
a
i
of
A
has at most Δ
I
positive elements, and each row
c
k
of
C
has at most Δ
K
positive elements.
We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on
local algorithms
(constant-time distributed algorithms). We show that for any Δ
I
≥2, Δ
K
≥2, and
ε
>0 there exists a local algorithm that achieves the approximation ratio Δ
I
(1−1/Δ
K
)+
ε
. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio Δ
I
(1−1/Δ
K
) for any Δ
I
≥2 and Δ
K
≥2. |
|---|---|
| AbstractList | In a
max-min LP
, the objective is to maximise
ω
subject to
A
x
≤
1
,
C
x
≥
ω
1
, and
x
≥
0
. In a
min-max LP
, the objective is to minimise
ρ
subject to
A
x
≤
ρ
1
,
C
x
≥
1
, and
x
≥
0
. The matrices
A
and
C
are nonnegative and sparse: each row
a
i
of
A
has at most Δ
I
positive elements, and each row
c
k
of
C
has at most Δ
K
positive elements.
We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on
local algorithms
(constant-time distributed algorithms). We show that for any Δ
I
≥2, Δ
K
≥2, and
ε
>0 there exists a local algorithm that achieves the approximation ratio Δ
I
(1−1/Δ
K
)+
ε
. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio Δ
I
(1−1/Δ
K
) for any Δ
I
≥2 and Δ
K
≥2. In a max-min LP, the objective is to maximise omega subject to A x less than or equal to 1, C x greater than or equal to omega 1, and x greater than or equal to 0. In a min-max LP, the objective is to minimise rho subject to A x less than or equal to rho 1, C x greater than or equal to 1, and x greater than or equal to 0. The matrices A and C are nonnegative and sparse: each row a sub( )iof A has at most Delta sub( )Ipositive elements, and each row c sub( )kof C has at most Delta sub( )Kpositive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any Delta sub( )I.2, Delta sub( )K.2, and epsilon >0 there exists a local algorithm that achieves the approximation ratio Delta sub( )I1-1/ Delta sub( )K+ epsilon . We also show that this result is the best possible: no local algorithm can achieve the approximation ratio Delta sub( )I1-1/ Delta sub( )K for any Delta sub( )I.2 and Delta sub( )K.2. Issue Title: Special Issue: Parallelism in Algorithms and Architectures In a max-min LP, the objective is to maximise ... subject to ... , and ... . In a min-max LP, the objective is to minimise ρ subject to ... , ... , and ... . The matrices A and C are nonnegative and sparse: each row ... of A has at most ... positive elements, and each row ... of C has at most ... positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ... , ... , and ... there exists a local algorithm that achieves the approximation ratio ... . We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ... for any ... and ... . (ProQuest: ... denotes formulae and non-USASCII text omitted) |
| Author | Kaski, Petteri Floréen, Patrik Musto, Topi Suomela, Jukka Kaasinen, Joel Hassinen, Marja |
| Author_xml | – sequence: 1 givenname: Patrik surname: Floréen fullname: Floréen, Patrik organization: Helsinki Institute for Information Technology HIIT, University of Helsinki – sequence: 2 givenname: Marja surname: Hassinen fullname: Hassinen, Marja organization: Helsinki Institute for Information Technology HIIT, University of Helsinki – sequence: 3 givenname: Joel surname: Kaasinen fullname: Kaasinen, Joel organization: Helsinki Institute for Information Technology HIIT, University of Helsinki – sequence: 4 givenname: Petteri surname: Kaski fullname: Kaski, Petteri organization: Helsinki Institute for Information Technology HIIT, University of Helsinki – sequence: 5 givenname: Topi surname: Musto fullname: Musto, Topi organization: Helsinki Institute for Information Technology HIIT, University of Helsinki – sequence: 6 givenname: Jukka surname: Suomela fullname: Suomela, Jukka email: jukka.suomela@cs.helsinki.fi organization: Helsinki Institute for Information Technology HIIT, University of Helsinki |
| BookMark | eNp9kE1LAzEQhoNUsFZ_gLfFi6fobLLdTcBLKX5Bix70HKbZbEnZJjXZQvvvTV1BKOhpZuB5h5fnnAycd4aQqxxuc4DqLgIwVlDIgUoOnJYnZJgXnFMoJAy-d0YLPoYzch7jCgC4ABiS-5nX2GaTzSb4nV3jwra222e-yea4o3PrMnR1liZNdzazzmDI3oJfBlzHC3LaYBvN5c8ckY_Hh_fpM529Pr1MJzOquYSOVlDUWotS17osmlzXY8akqBsUAqUp0aAWdSnYYpwuwRs0i0ZLZNIUsmZY8xG56f-mkp9bEzu1tlGbtkVn_DYqWXLBKyaqRF4fkSu_DS6VU0KOOWNllSeo6iEdfIzBNErbDjvrXRfQtioHdXCqeqcqOVUHp6pMyfwouQlJWtj_m2F9JibWLU34rfR36Auu6YoW |
| CODEN | TCSYFI |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2020_12_017 crossref_primary_10_1145_2431211_2431223 crossref_primary_10_1007_s00446_013_0202_3 crossref_primary_10_1007_s00446_015_0245_8 crossref_primary_10_1007_s10514_019_09856_1 |
| Cites_doi | 10.1109/ISTCS.1995.377023 10.1137/S0097539793254571 10.1109/SFCS.1991.185377 10.1145/1109557.1109666 10.1145/174644.174650 10.1145/2455.214106 10.1016/j.ipl.2009.02.017 10.1007/978-3-642-05118-0_2 10.1007/s00453-009-9353-9 10.1137/0221015 10.1007/978-3-540-92862-1_2 10.1145/1810479.1810533 10.1007/978-3-642-04355-0_21 10.1007/978-3-540-87779-0_27 10.1007/978-3-540-87779-0_6 10.1109/SFCS.2001.959930 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC 2010 Springer Science+Business Media, LLC 2011 |
| Copyright_xml | – notice: Springer Science+Business Media, LLC 2010 – notice: Springer Science+Business Media, LLC 2011 |
| DBID | AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L.0 L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U |
| DOI | 10.1007/s00224-010-9303-6 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Collection (ProQuest) ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Collection (ProQuest) Computing Database Science Database (ProQuest) Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ABI/INFORM Collection China ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Professional Standard ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Computer and Information Systems Abstracts ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1433-0490 |
| EndPage | 697 |
| ExternalDocumentID | 2473048521 10_1007_s00224_010_9303_6 |
| Genre | Feature |
| GroupedDBID | --Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 2.D 203 29Q 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8V8 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADPHR ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D0L DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ3 GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- MK~ ML~ NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF- PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R89 R9I RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XOL YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~8M AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L.0 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U PUEGO |
| ID | FETCH-LOGICAL-c390t-704dcc86cdc64f1cd52298dfa88a9e6aeac8d682b59e683faebfc9a29e49d2ad3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000295519200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1432-4350 |
| IngestDate | Fri Sep 05 13:39:00 EDT 2025 Tue Nov 04 18:53:36 EST 2025 Sat Nov 29 03:28:54 EST 2025 Tue Nov 18 22:38:30 EST 2025 Fri Feb 21 02:34:32 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Local algorithms Approximation algorithms Distributed algorithms Linear programs |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c390t-704dcc86cdc64f1cd52298dfa88a9e6aeac8d682b59e683faebfc9a29e49d2ad3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| OpenAccessLink | http://hdl.handle.net/10138/28034 |
| PQID | 895322671 |
| PQPubID | 48907 |
| PageCount | 26 |
| ParticipantIDs | proquest_miscellaneous_963837287 proquest_journals_895322671 crossref_citationtrail_10_1007_s00224_010_9303_6 crossref_primary_10_1007_s00224_010_9303_6 springer_journals_10_1007_s00224_010_9303_6 |
| PublicationCentury | 2000 |
| PublicationDate | 20111100 2011-11-00 20111101 |
| PublicationDateYYYYMMDD | 2011-11-01 |
| PublicationDate_xml | – month: 11 year: 2011 text: 20111100 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Theory of computing systems |
| PublicationTitleAbbrev | Theory Comput Syst |
| PublicationYear | 2011 |
| Publisher | Springer-Verlag Springer Nature B.V |
| Publisher_xml | – name: Springer-Verlag – name: Springer Nature B.V |
| References | Floréen, Kaski, Polishchuk, Suomela (CR11) 2010; 58 Lenzen, Suomela, Wattenhofer (CR19) 2009 Czygrinow, Hańćkowiak, Wawrzyniak (CR7) 2008 Naor, Stockmeyer (CR24) 1995; 24 Awerbuch, Sipser (CR4) 1988 Awerbuch, Varghese (CR5) 1991 Lenzen, Oswald, Wattenhofer (CR18) 2008 Hańćkowiak, Karoński, Panconesi (CR12) 1998 CR15 CR14 Kuhn, Moscibroda, Wattenhofer (CR16) 2006 Linial (CR21) 1992; 21 Kuhn, Moscibroda, Wattenhofer (CR17) 2006 Hochbaum, Maass (CR13) 1985; 32 Papadimitriou, Yannakakis (CR25) 1993 Floréen, Kaski, Musto, Suomela (CR10) 2008 Mayer, Naor, Stockmeyer (CR22) 1995 Angluin (CR1) 1980 Polishchuk, Suomela (CR26) 2009; 109 Floréen, Kaasinen, Kaski, Suomela (CR9) 2009 Lenzen, Wattenhofer (CR20) 2008 Åstrand, Floréen, Polishchuk, Rybicki, Suomela, Uitto (CR2) 2009 CR28 Baker (CR6) 1994; 41 CR27 CR23 Young (CR29) 2001 Floréen, Hassinen, Kaski, Suomela (CR8) 2008 Åstrand, Suomela (CR3) 2010 A. Mayer (9303_CR22) 1995 N.E. Young (9303_CR29) 2001 D. Angluin (9303_CR1) 1980 D.S. Hochbaum (9303_CR13) 1985; 32 P. Floréen (9303_CR8) 2008 P. Floréen (9303_CR10) 2008 M. Naor (9303_CR24) 1995; 24 9303_CR15 P. Floréen (9303_CR9) 2009 9303_CR14 P. Floréen (9303_CR11) 2010; 58 M. Hańćkowiak (9303_CR12) 1998 V. Polishchuk (9303_CR26) 2009; 109 A. Czygrinow (9303_CR7) 2008 C. Lenzen (9303_CR19) 2009 B.S. Baker (9303_CR6) 1994; 41 B. Awerbuch (9303_CR5) 1991 M. Åstrand (9303_CR3) 2010 F. Kuhn (9303_CR17) 2006 C. Lenzen (9303_CR18) 2008 N. Linial (9303_CR21) 1992; 21 9303_CR28 9303_CR27 M. Åstrand (9303_CR2) 2009 B. Awerbuch (9303_CR4) 1988 9303_CR23 C.H. Papadimitriou (9303_CR25) 1993 C. Lenzen (9303_CR20) 2008 F. Kuhn (9303_CR16) 2006 |
| References_xml | – start-page: 191 year: 2009 end-page: 205 ident: CR2 article-title: A local 2-approximation algorithm for the vertex cover problem publication-title: Proc. 23rd International Symposium on Distributed Computing (DISC) – start-page: 82 year: 1980 end-page: 93 ident: CR1 article-title: Local and global properties in networks of processors publication-title: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC) – start-page: 268 year: 1995 end-page: 278 ident: CR22 article-title: Local computations on static and dynamic graphs publication-title: Proc. 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS) doi: 10.1109/ISTCS.1995.377023 – start-page: 538 year: 2001 end-page: 546 ident: CR29 article-title: Sequential and parallel algorithms for mixed packing and covering publication-title: Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS) – volume: 24 start-page: 1259 issue: 6 year: 1995 end-page: 1277 ident: CR24 article-title: What can be computed locally publication-title: SIAM J. Comput. doi: 10.1137/S0097539793254571 – start-page: 78 year: 2008 end-page: 92 ident: CR7 article-title: Fast distributed approximations in planar graphs publication-title: Proc. 22nd International Symposium on Distributed Computing (DISC) – ident: CR14 – start-page: 258 year: 1991 end-page: 267 ident: CR5 article-title: Distributed program checking: a paradigm for building self-stabilizing distributed protocols publication-title: Proc. 32nd Annual Symposium on Foundations of Computer Science (FOCS) doi: 10.1109/SFCS.1991.185377 – start-page: 980 year: 2006 end-page: 989 ident: CR17 article-title: The price of being near-sighted publication-title: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) doi: 10.1145/1109557.1109666 – start-page: 219 year: 1998 end-page: 225 ident: CR12 article-title: On the distributed complexity of computing maximal matchings publication-title: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) – year: 2006 ident: CR16 article-title: Fault-tolerant clustering in ad hoc and sensor networks publication-title: Proc. 26th IEEE International Conference on Distributed Computing Systems (ICDCS) – volume: 41 start-page: 153 issue: 1 year: 1994 end-page: 180 ident: CR6 article-title: Approximation algorithms for NP-complete problems on planar graphs publication-title: J. ACM doi: 10.1145/174644.174650 – ident: CR27 – ident: CR23 – volume: 32 start-page: 130 issue: 1 year: 1985 end-page: 136 ident: CR13 article-title: Approximation schemes for covering and packing problems in image processing and VLSI publication-title: J. ACM doi: 10.1145/2455.214106 – year: 2008 ident: CR10 article-title: Approximating max-min linear programs with local algorithms publication-title: Proc. 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS) – volume: 109 start-page: 642 issue: 12 year: 2009 end-page: 645 ident: CR26 article-title: A simple local 3-approximation algorithm for vertex cover publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2009.02.017 – start-page: 17 year: 2009 end-page: 34 ident: CR19 article-title: Local algorithms: self-stabilization on speed publication-title: Proc. 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) doi: 10.1007/978-3-642-05118-0_2 – volume: 58 start-page: 102 issue: 1 year: 2010 end-page: 118 ident: CR11 article-title: Almost stable matchings by truncating the Gale–Shapley algorithm publication-title: Algorithmica doi: 10.1007/s00453-009-9353-9 – ident: CR15 – start-page: 206 year: 1988 end-page: 219 ident: CR4 article-title: Dynamic networks are as fast as static networks publication-title: Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS) – volume: 21 start-page: 193 issue: 1 year: 1992 end-page: 201 ident: CR21 article-title: Locality in distributed graph algorithms publication-title: SIAM J. Comput. doi: 10.1137/0221015 – start-page: 2 year: 2008 end-page: 17 ident: CR8 article-title: Tight local approximation results for max-min linear programs publication-title: Proc. 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors) doi: 10.1007/978-3-540-92862-1_2 – start-page: 260 year: 2009 end-page: 269 ident: CR9 article-title: An optimal local approximation algorithm for max-min linear programs publication-title: Proc. 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) – ident: CR28 – start-page: 294 year: 2010 end-page: 302 ident: CR3 article-title: Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks publication-title: Proc. 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) – start-page: 46 year: 2008 end-page: 54 ident: CR18 article-title: What can be approximated locally publication-title: Proc. 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) – start-page: 394 year: 2008 end-page: 407 ident: CR20 article-title: Leveraging Linial’s locality limit publication-title: Proc. 22nd International Symposium on Distributed Computing (DISC) – start-page: 121 year: 1993 end-page: 129 ident: CR25 article-title: Linear programming without the matrix publication-title: Proc. 25th Annual ACM Symposium on Theory of Computing (STOC) – ident: 9303_CR23 – start-page: 294 volume-title: Proc. 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) year: 2010 ident: 9303_CR3 doi: 10.1145/1810479.1810533 – start-page: 206 volume-title: Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS) year: 1988 ident: 9303_CR4 – volume: 58 start-page: 102 issue: 1 year: 2010 ident: 9303_CR11 publication-title: Algorithmica doi: 10.1007/s00453-009-9353-9 – volume: 24 start-page: 1259 issue: 6 year: 1995 ident: 9303_CR24 publication-title: SIAM J. Comput. doi: 10.1137/S0097539793254571 – volume: 109 start-page: 642 issue: 12 year: 2009 ident: 9303_CR26 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2009.02.017 – start-page: 260 volume-title: Proc. 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) year: 2009 ident: 9303_CR9 – start-page: 191 volume-title: Proc. 23rd International Symposium on Distributed Computing (DISC) year: 2009 ident: 9303_CR2 doi: 10.1007/978-3-642-04355-0_21 – ident: 9303_CR14 – start-page: 394 volume-title: Proc. 22nd International Symposium on Distributed Computing (DISC) year: 2008 ident: 9303_CR20 doi: 10.1007/978-3-540-87779-0_27 – volume-title: Proc. 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS) year: 2008 ident: 9303_CR10 – volume: 21 start-page: 193 issue: 1 year: 1992 ident: 9303_CR21 publication-title: SIAM J. Comput. doi: 10.1137/0221015 – start-page: 46 volume-title: Proc. 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) year: 2008 ident: 9303_CR18 – volume: 41 start-page: 153 issue: 1 year: 1994 ident: 9303_CR6 publication-title: J. ACM doi: 10.1145/174644.174650 – volume-title: Proc. 26th IEEE International Conference on Distributed Computing Systems (ICDCS) year: 2006 ident: 9303_CR16 – start-page: 980 volume-title: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) year: 2006 ident: 9303_CR17 doi: 10.1145/1109557.1109666 – ident: 9303_CR28 – start-page: 78 volume-title: Proc. 22nd International Symposium on Distributed Computing (DISC) year: 2008 ident: 9303_CR7 doi: 10.1007/978-3-540-87779-0_6 – start-page: 219 volume-title: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) year: 1998 ident: 9303_CR12 – start-page: 538 volume-title: Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS) year: 2001 ident: 9303_CR29 doi: 10.1109/SFCS.2001.959930 – start-page: 2 volume-title: Proc. 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors) year: 2008 ident: 9303_CR8 doi: 10.1007/978-3-540-92862-1_2 – ident: 9303_CR15 – start-page: 17 volume-title: Proc. 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) year: 2009 ident: 9303_CR19 doi: 10.1007/978-3-642-05118-0_2 – start-page: 121 volume-title: Proc. 25th Annual ACM Symposium on Theory of Computing (STOC) year: 1993 ident: 9303_CR25 – start-page: 82 volume-title: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC) year: 1980 ident: 9303_CR1 – start-page: 268 volume-title: Proc. 3rd Israel Symposium on the Theory of Computing and Systems (ISTCS) year: 1995 ident: 9303_CR22 doi: 10.1109/ISTCS.1995.377023 – start-page: 258 volume-title: Proc. 32nd Annual Symposium on Foundations of Computer Science (FOCS) year: 1991 ident: 9303_CR5 doi: 10.1109/SFCS.1991.185377 – volume: 32 start-page: 130 issue: 1 year: 1985 ident: 9303_CR13 publication-title: J. ACM doi: 10.1145/2455.214106 – ident: 9303_CR27 |
| SSID | ssj0003800 |
| Score | 1.9534545 |
| Snippet | In a
max-min LP
, the objective is to maximise
ω
subject to
A
x
≤
1
,
C
x
≥
ω
1
, and
x
≥
0
. In a
min-max LP
, the objective is to minimise
ρ
subject to
A
x
≤... Issue Title: Special Issue: Parallelism in Algorithms and Architectures In a max-min LP, the objective is to maximise ... subject to ... , and ... . In a... In a max-min LP, the objective is to maximise omega subject to A x less than or equal to 1, C x greater than or equal to omega 1, and x greater than or equal... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 672 |
| SubjectTerms | Algorithms Approximation Bandwidths Communication Computation Computer Science Hierarchies Internet access Internet service providers Linear programming Mathematical analysis Matrices Matrix methods Sensors Studies Theory of Computation Wireless networks |
| SummonAdditionalLinks | – databaseName: Science Database (ProQuest) dbid: M2P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB58HfTgW1xf5OBJCbZNHwkIIqJ4cJc9KHgraR6woN11uyv6751k2y4KevFUQpumdJ7JzHwDcCqSQMUyFNRKixuUVCsqWWFoUqgEHfRIK134ZhNZr8efn0W_zs2p6rTKRid6Ra2Hyp2RX3CRIO-lWXg1eqOuaZQLrtYdNBZhGR2b0GV0daN-q4gZ9xUo6BG4wqCkDWoGHkMUbRd1kWCBSpym383S3Nf8ER71Vudu45_fuwnrtbtJrmf8sQULptyGjaaVA6klexvWui18a7UDlw_OwpFrhzf-MXidQXl_kqElXflBu4OSyFITvFIcE9zOoriQ_izTq9qFp7vbx5t7WrdZoIqJYEKzINZK8VRplcY2VBpdMsG1lZxLYVKJqpnrlEdFgiPOrDSFVUJGwsRCR1KzPVgqh6XZB6IYE6zA6aG2sUTfS4mgMCLKZGJdDVAHguYv56rGIHetMF7yFj3ZEyZHwuSOMHnagbN2ymgGwPHXw4cNMfJaFqu8pUQHSHsXhchFRmRphtMqd1qIZcibHThvCD5_wa_LHfy53CGs-gNoX7h4BEuT8dQcw4p6nwyq8Yln1S_9Ae4Y priority: 102 providerName: ProQuest |
| Title | Local Approximability of Max-Min and Min-Max Linear Programs |
| URI | https://link.springer.com/article/10.1007/s00224-010-9303-6 https://www.proquest.com/docview/895322671 https://www.proquest.com/docview/963837287 |
| Volume | 49 |
| WOSCitedRecordID | wos000295519200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: 7WY dateStart: 20020101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Collection (ProQuest) customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: M0C dateStart: 20020101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: P5Z dateStart: 20020101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: K7- dateStart: 20020101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: M7S dateStart: 20020101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: BENPR dateStart: 20020101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database (ProQuest) customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: M2P dateStart: 20020101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLink Journals customDbUrl: eissn: 1433-0490 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1db9Mw8MRaHtjDCoVpXVnlB55AltI4H7bES1e1mgStoo6Pwkvk-EOqBClaOlT-_c5ukgkESPBykRV_ROf7cs53B_BCxIGK5FhQKy0eUBKtqGSFoXGhYjTQQ6104YtNpMslX69FVsdxV81t98Yl6SV1G-zm1Q11zluBcpcmR9BFbcddvYbV9YdW_DLu407QDnDhQHHryvzdFD8ro3sL8xenqNc1895_feVjOKlNSzI50MITeGDKPvSasg2k5uI-HC_aVK3VU3j91mkzMnG5xfebr4e03T_I1pKF3NPFpiSy1ASfFNsEj67IGiQ73OqqnsH7-ezd9IrWJRWoYiLY0TSItFI8UVolkR0rjeaX4NpKzqUwiUQxzHXCwyLGFmdWmsIqIUNhIqFDqdkpdMptac6AKMYEK3D4WNtIop2lRFAYEaYyti7eZwBBg9tc1fnGXdmLL3mbKdnjKkdc5Q5XeTKAl-2Qb4dkG3_rPGw2LK_5rsq5iFFCJel4AKR9iwzjvCCyNNvbKncSh6VIhwN41Wzh_QR_XO78n3oP4ZH_-eyDFp9DZ3dzay7gofq-21Q3IzhKP34aQfdytsxW2HqTUoSLYOpgmDmYXiPM4s8jT9x3HxHrJg |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB7xqAQcoOUhtkDrQ3uhssjmaUsghNoiELurPVCJm-v4Ia0EWSALhR_Ff2TsPBCV4MaBU2QltuXMeB4ezzcA33gSqFh2ObXSooOSakVllBua5CpBAz3USue-2EQ2GLCzMz6cgocmF8Zdq2xkohfUeqzcGfkO4wnyXpp19y-vqCsa5YKrTQWNiitOzP0_9NjKveNfSN7vYXj4-_TnEa2LClCF7v2EZkGslWKp0iqNbVdpNEA401YyJrlJJQoiplMW5gm2WGSlya3iMuQm5jqUOsJxp2E2dsBi7qZgOGwFf8R8xgtaIC4RKWmDqIHHLEVdSV3kmaPSoOlzNfhk2_4XjvVa7nDpnf2fj7BYm9PkoOL_TzBlimVYakpVkFpyLcNCv4WnLVdgt-c0ODlweOp3o4sKqvyejC3pyzvaHxVEFprgk2KboLuOCyPD6iZbuQp_3mRFazBTjAuzDkRFEY9y7N7VNpZoWyoe5IaHmUysy3HqQNBQVagaY92V-jgXLTq0ZwSBjCAcI4i0A9ttl8sKYOS1jzca4ota1pSipXwHSPsWhYSL_MjCjG9K4aRslOHe68CPhsGeBnhxus-vTvcV5o5O-z3ROx6cbMC8P2z3SZqbMDO5vjFb8EHdTkbl9Re_TQj8fWu-ewSjaE-e |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LSxwxGP_whdiDrypu1ZqDXizB2XkmYCmiXSq6yx4qSC9pJg9Y0Fl11lb_tP53_ZJ5iAW9eehpCDNJyOSX75HvBbDLk0DFssuplRYVlFQrKqPc0CRXCQrooVY698UmssGAXV7y4RT8aWJhnFtlQxM9odZj5e7IDxhPEHtp1j2wtVfE8KT35eaWugJSztDaVNOoEHJmHn-j9lZ-Pj3Brd4Lw97X78ffaF1ggCpU9Sc0C2KtFEuVVmlsu0qjMMKZtpIxyU0qkSgxnbIwT7DFIitNbhWXITcx16HUEY47DbMZqpjOm3CY_GiZQMR89AtKIy4oKWkNqoHPX4p8kzorNEcGQtPnLPFJzv3HNOs5Xm_pP_5Xy7BYi9nkqDoXKzBlilVYakpYkJqircK7fpu2tnwPh-eOs5Mjl2f9YXRdpTB_JGNL-vKB9kcFkYUm-KTYJqjG48LIsPJwK9fg4k1WtA4zxbgwG0BUFPEox-5dbWOJMqfiQW54mMnEutinDgTNDgtV5153JUCuRJs12oNCICiEA4VIO7DfdrmpEo-89vFmAwRR06BStCjoAGnfIvFwFiFZmPF9KRz1jTI8kx341IDtaYAXp_vw6nQ7MI9wE-eng7NNWPB38D52cwtmJnf3Zhvm1K_JqLz76E8MgZ9vDbu_xItYig |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Local+Approximability+of+Max-Min+and+Min-Max+Linear+Programs&rft.jtitle=Theory+of+computing+systems&rft.au=Flor%C3%A9en%2C+Patrik&rft.au=Hassinen%2C+Marja&rft.au=Kaasinen%2C+Joel&rft.au=Kaski%2C+Petteri&rft.date=2011-11-01&rft.issn=1432-4350&rft.eissn=1433-0490&rft.volume=49&rft.issue=4&rft.spage=672&rft.epage=697&rft_id=info:doi/10.1007%2Fs00224-010-9303-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00224_010_9303_6 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-4350&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-4350&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-4350&client=summon |